{"id":"https://openalex.org/W2051736660","doi":"https://doi.org/10.1080/10556780500139872","title":"Complexity of general continuous minimization problems: a survey","display_name":"Complexity of general continuous minimization problems: a survey","publication_year":2005,"publication_date":"2005-08-01","ids":{"openalex":"https://openalex.org/W2051736660","doi":"https://doi.org/10.1080/10556780500139872","mag":"2051736660"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500139872","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500139872","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5017772794","display_name":"M. Gaviano","orcid":null},"institutions":[{"id":"https://openalex.org/I172446870","display_name":"University of Cagliari","ror":"https://ror.org/003109y17","country_code":"IT","type":"education","lineage":["https://openalex.org/I172446870"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"M. Gaviano","raw_affiliation_strings":["Mathematics Department , University of Cagliari , Via Ospedale 72, 09124, Cagliari,  Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Department , University of Cagliari , Via Ospedale 72, 09124, Cagliari,  Italy","institution_ids":["https://openalex.org/I172446870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113610345","display_name":"Daniela Lera","orcid":null},"institutions":[{"id":"https://openalex.org/I172446870","display_name":"University of Cagliari","ror":"https://ror.org/003109y17","country_code":"IT","type":"education","lineage":["https://openalex.org/I172446870"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"D. Lera","raw_affiliation_strings":["Mathematics Department , University of Cagliari , Via Ospedale 72, 09124, Cagliari,  Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics Department , University of Cagliari , Via Ospedale 72, 09124, Cagliari,  Italy","institution_ids":["https://openalex.org/I172446870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5017772794"],"corresponding_institution_ids":["https://openalex.org/I172446870"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.15017911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"20","issue":"4-5","first_page":"525","last_page":"544"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.996399998664856,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9922999739646912,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.779018759727478},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6236680746078491},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6199614405632019},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5227006673812866},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49309393763542175},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.45726901292800903},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4391828179359436},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.43816646933555603},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29109835624694824}],"concepts":[{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.779018759727478},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6236680746078491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6199614405632019},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5227006673812866},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49309393763542175},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.45726901292800903},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4391828179359436},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.43816646933555603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29109835624694824},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556780500139872","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500139872","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:iris.unica.it:11584/100253","is_oa":false,"landing_page_url":"http://hdl.handle.net/11584/100253","pdf_url":null,"source":{"id":"https://openalex.org/S4377196293","display_name":"UNICA IRIS Institutional Research Information System (University of Cagliari)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172446870","host_organization_name":"University of Cagliari","host_organization_lineage":["https://openalex.org/I172446870"],"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":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W569270505","https://openalex.org/W605736217","https://openalex.org/W1503705371","https://openalex.org/W1505731132","https://openalex.org/W1509672405","https://openalex.org/W1509805685","https://openalex.org/W1518039036","https://openalex.org/W1525928598","https://openalex.org/W1579063588","https://openalex.org/W1632601927","https://openalex.org/W1655990431","https://openalex.org/W1979881015","https://openalex.org/W1990493192","https://openalex.org/W1994550052","https://openalex.org/W2019886197","https://openalex.org/W2033040247","https://openalex.org/W2056243826","https://openalex.org/W2065704444","https://openalex.org/W2076680677","https://openalex.org/W2090797181","https://openalex.org/W2119632057","https://openalex.org/W2137224975","https://openalex.org/W2151554678","https://openalex.org/W2259546388","https://openalex.org/W2301746362","https://openalex.org/W2317988884","https://openalex.org/W2485544084","https://openalex.org/W2530361182","https://openalex.org/W2569481888","https://openalex.org/W2584216746","https://openalex.org/W2611147814","https://openalex.org/W4213316265","https://openalex.org/W4242706555","https://openalex.org/W4300987062","https://openalex.org/W6630094177"],"related_works":["https://openalex.org/W4364379828","https://openalex.org/W2068800669","https://openalex.org/W2032560733","https://openalex.org/W2613992027","https://openalex.org/W1977059499","https://openalex.org/W3145335096","https://openalex.org/W2125168722","https://openalex.org/W2026518960","https://openalex.org/W2134774409","https://openalex.org/W2065981317"],"abstract_inverted_index":{"The":[0,42],"problem":[1],"of":[2,10,45,53,59],"finding":[3],"a":[4,7,11,15,29],"local":[5,91],"or":[6,56],"global":[8,93],"minimum":[9],"real":[12,23],"function":[13,54],"on":[14],"set":[16],"S\u2286":[17],"\u211d":[18],"n":[19],"occurs":[20],"in":[21,68],"many":[22],"world":[24],"problems.":[25],"When":[26],"f":[27],"is":[28],"general":[30],"nonlinear":[31],"function,":[32],"deterministic":[33],"as":[34,36],"well":[35],"stochastic":[37],"algorithms":[38],"have":[39],"been":[40,66],"proposed.":[41],"numerical":[43],"cost":[44],"these":[46],"algorithms,":[47],"that":[48,106],"can":[49],"be":[50],"the":[51,57,69,78,86,97,104],"number":[52,58],"evaluations":[55],"elementary":[60],"operations":[61],"required":[62],"when":[63],"executed,":[64],"has":[65],"investigated":[67],"last":[70],"few":[71],"years.":[72],"In":[73],"this":[74],"paper,":[75],"we":[76],"survey":[77],"main":[79],"results":[80,102],"by":[81],"classifying":[82],"them":[83],"according":[84],"to":[85],"field":[87],"they":[88],"refer":[89],"to:":[90],"minimization,":[92],"minimization":[94],"and":[95],"checking":[96],"optimality":[98],"conditions.":[99],"Further,":[100],"some":[101],"concerning":[103],"information":[105],"an":[107],"algorithm":[108],"may":[109],"use,":[110],"are":[111],"surveyed.":[112]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}