{"id":"https://openalex.org/W2013823866","doi":"https://doi.org/10.1137/s1052623494277317","title":"Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search","display_name":"Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2013823866","doi":"https://doi.org/10.1137/s1052623494277317","mag":"2013823866"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623494277317","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494277317","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102842741","display_name":"William E. Hart","orcid":"https://orcid.org/0000-0002-6849-2780"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"William E. Hart","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102842741"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2795,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.87723267,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"9","issue":"1","first_page":"270","last_page":"290"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9854000210762024,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9811999797821045,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9587000012397766,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.7717164754867554},{"id":"https://openalex.org/keywords/stopping-rule","display_name":"Stopping rule","score":0.6832727193832397},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6291738152503967},{"id":"https://openalex.org/keywords/stopping-time","display_name":"Stopping time","score":0.5761885046958923},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5382506847381592},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5122920274734497},{"id":"https://openalex.org/keywords/early-stopping","display_name":"Early stopping","score":0.4582504630088806},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4414437413215637},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.43647873401641846},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.43190333247184753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2402476668357849},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13391447067260742},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11663129925727844}],"concepts":[{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.7717164754867554},{"id":"https://openalex.org/C2983961125","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping rule","level":2,"score":0.6832727193832397},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6291738152503967},{"id":"https://openalex.org/C99888217","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping time","level":2,"score":0.5761885046958923},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5382506847381592},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5122920274734497},{"id":"https://openalex.org/C5465570","wikidata":"https://www.wikidata.org/wiki/Q5326898","display_name":"Early stopping","level":3,"score":0.4582504630088806},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4414437413215637},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.43647873401641846},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.43190333247184753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2402476668357849},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13391447067260742},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11663129925727844},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s1052623494277317","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494277317","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1971589677","https://openalex.org/W1974157591","https://openalex.org/W1994654315","https://openalex.org/W1998415688","https://openalex.org/W1998930261","https://openalex.org/W2011221296","https://openalex.org/W2013226802","https://openalex.org/W2019246466","https://openalex.org/W2028541933","https://openalex.org/W2029404999","https://openalex.org/W2031120110","https://openalex.org/W2042817760","https://openalex.org/W2046636186","https://openalex.org/W2054875385","https://openalex.org/W2075373053","https://openalex.org/W2080162860","https://openalex.org/W2081378606","https://openalex.org/W2164931226"],"related_works":["https://openalex.org/W2349258365","https://openalex.org/W2081685205","https://openalex.org/W2002489931","https://openalex.org/W3208370919","https://openalex.org/W3121576265","https://openalex.org/W1511853515","https://openalex.org/W4239299965","https://openalex.org/W4250338927","https://openalex.org/W1605843535","https://openalex.org/W1982261337"],"abstract_inverted_index":{"Sequential":[0],"stopping":[1,30,59,71,77,102,110],"rules":[2,18,31,60,72,78,103,111],"are":[3,19,65],"described":[4,20],"for":[5,21,73,112],"several":[6],"stochastic":[7],"algorithms":[8,46],"that":[9,57,100],"estimate":[10,34],"the":[11,36,40,69],"global":[12],"minimum":[13],"of":[14,35,39],"a":[15,48,95],"function.":[16],"Stopping":[17],"pure":[22],"random":[23,27],"search":[24,86],"and":[25,64,87],"stratified":[26,88],"search.":[28,91,115],"These":[29,76],"use":[32],"an":[33],"probability":[37],"measure":[38],"$\\epsilon$-close":[41],"points":[42],"to":[43,83],"terminate":[44],"these":[45,58,74,101],"when":[47],"specified":[49],"confidence":[50],"has":[51],"been":[52],"achieved.":[53],"Numerical":[54,92],"results":[55,93],"indicate":[56],"require":[61],"fewer":[62],"samples":[63],"more":[66],"reliable":[67],"than":[68],"previous":[70],"algorithms.":[75],"can":[79,104],"also":[80],"be":[81],"applied":[82],"multistart":[84,89,113],"local":[85,90,114],"on":[94],"standard":[96],"test":[97],"set":[98],"show":[99],"perform":[105],"as":[106,108],"well":[107],"Bayesian":[109]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}