{"id":"https://openalex.org/W2794440401","doi":"https://doi.org/10.1007/s12532-017-0131-4","title":"Asynchronously parallel optimization solver for finding multiple minima","display_name":"Asynchronously parallel optimization solver for finding multiple minima","publication_year":2018,"publication_date":"2018-02-16","ids":{"openalex":"https://openalex.org/W2794440401","doi":"https://doi.org/10.1007/s12532-017-0131-4","mag":"2794440401"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-017-0131-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-017-0131-4","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.osti.gov/biblio/1466333","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033895985","display_name":"Jeffrey Larson","orcid":"https://orcid.org/0000-0001-9924-2082"},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeffrey Larson","raw_affiliation_strings":["Argonne National Laboratory, 9700 S. Cass Ave., Bldg. 240, Lemont, IL, 60439, USA"],"affiliations":[{"raw_affiliation_string":"Argonne National Laboratory, 9700 S. Cass Ave., Bldg. 240, Lemont, IL, 60439, USA","institution_ids":["https://openalex.org/I1282105669"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083426306","display_name":"Stefan M. Wild","orcid":"https://orcid.org/0000-0002-6099-2772"},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stefan M. Wild","raw_affiliation_strings":["Argonne National Laboratory, 9700 S. Cass Ave., Bldg. 240, Lemont, IL, 60439, USA"],"affiliations":[{"raw_affiliation_string":"Argonne National Laboratory, 9700 S. Cass Ave., Bldg. 240, Lemont, IL, 60439, USA","institution_ids":["https://openalex.org/I1282105669"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033895985"],"corresponding_institution_ids":["https://openalex.org/I1282105669"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":3.0705,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.90848163,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"10","issue":"3","first_page":"303","last_page":"332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.9100418090820312},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7397776246070862},{"id":"https://openalex.org/keywords/python","display_name":"Python (programming language)","score":0.6803462505340576},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6606918573379517},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6284252405166626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5593909025192261},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5291358232498169},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.5201457142829895},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47240084409713745},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46124428510665894},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.4408009350299835},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.43718138337135315},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.41057026386260986},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3428742289543152}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.9100418090820312},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7397776246070862},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.6803462505340576},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6606918573379517},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6284252405166626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5593909025192261},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5291358232498169},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.5201457142829895},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47240084409713745},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46124428510665894},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.4408009350299835},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.43718138337135315},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.41057026386260986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3428742289543152},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s12532-017-0131-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-017-0131-4","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},{"id":"pmh:oai:osti.gov:1466333","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1466333","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:osti.gov:1466333","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1466333","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W197187682","https://openalex.org/W617668761","https://openalex.org/W1969144558","https://openalex.org/W1982532564","https://openalex.org/W1993448217","https://openalex.org/W1995343013","https://openalex.org/W1996179806","https://openalex.org/W2015863994","https://openalex.org/W2022451981","https://openalex.org/W2025280025","https://openalex.org/W2057830724","https://openalex.org/W2058407505","https://openalex.org/W2064268969","https://openalex.org/W2067641876","https://openalex.org/W2080162860","https://openalex.org/W2083957939","https://openalex.org/W2098290609","https://openalex.org/W2113741278","https://openalex.org/W2123489408","https://openalex.org/W2138537392","https://openalex.org/W2144809990","https://openalex.org/W2181686101","https://openalex.org/W2285921046","https://openalex.org/W2610216665","https://openalex.org/W2755987995","https://openalex.org/W3015681923","https://openalex.org/W4234740503","https://openalex.org/W4254772338","https://openalex.org/W4298163389"],"related_works":["https://openalex.org/W2992877228","https://openalex.org/W4250124476","https://openalex.org/W2121922170","https://openalex.org/W2135119351","https://openalex.org/W3131312709","https://openalex.org/W54027447","https://openalex.org/W4210838092","https://openalex.org/W2100566702","https://openalex.org/W2753416958","https://openalex.org/W101084228"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}