{"id":"https://openalex.org/W4361221605","doi":"https://doi.org/10.1080/10556788.2023.2189711","title":"Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization","display_name":"Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization","publication_year":2023,"publication_date":"2023-03-28","ids":{"openalex":"https://openalex.org/W4361221605","doi":"https://doi.org/10.1080/10556788.2023.2189711"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2023.2189711","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1080/10556788.2023.2189711","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":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2078.1/296038","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029912059","display_name":"Geovani Nunes Grapiglia","orcid":"https://orcid.org/0000-0003-3284-3371"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Geovani Nunes Grapiglia","raw_affiliation_strings":["ICTEAM/INMA, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"],"raw_orcid":"https://orcid.org/0000-0003-3284-3371","affiliations":[{"raw_affiliation_string":"ICTEAM/INMA, Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029912059"],"corresponding_institution_ids":["https://openalex.org/I95674353"],"apc_list":null,"apc_paid":null,"fwci":0.1836,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.40034268,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"38","issue":"4","first_page":"781","last_page":"803"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.8159151077270508},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7861527800559998},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.67513108253479},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6376577019691467},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.6051158308982849},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.6036813259124756},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.540951132774353},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.521639883518219},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4603232443332672},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.44612306356430054},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44551894068717957},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4437461197376251},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41120877861976624},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3314000964164734},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27968189120292664}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.8159151077270508},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7861527800559998},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.67513108253479},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6376577019691467},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.6051158308982849},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.6036813259124756},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.540951132774353},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.521639883518219},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4603232443332672},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.44612306356430054},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44551894068717957},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4437461197376251},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41120877861976624},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3314000964164734},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27968189120292664},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2023.2189711","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1080/10556788.2023.2189711","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:dial.uclouvain.be:boreal:296038","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/296038","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization Methods and Software, Vol. 38, no.4, p. 781-803 (2023)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:dial.uclouvain.be:boreal:296038","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/296038","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization Methods and Software, Vol. 38, no.4, p. 781-803 (2023)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.800000011920929,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G3321561908","display_name":null,"funder_award_id":"312777/2020-5","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1976086748","https://openalex.org/W2004357692","https://openalex.org/W2016859302","https://openalex.org/W2097311548","https://openalex.org/W2128736738","https://openalex.org/W2133068139","https://openalex.org/W2189341307","https://openalex.org/W2251768944","https://openalex.org/W2326806701","https://openalex.org/W2334050185","https://openalex.org/W2337385024","https://openalex.org/W2591820521","https://openalex.org/W2739128850","https://openalex.org/W2774800844","https://openalex.org/W2801742348","https://openalex.org/W2951136802","https://openalex.org/W2959718058","https://openalex.org/W2963059367","https://openalex.org/W2980884817","https://openalex.org/W2997657492","https://openalex.org/W3113300291","https://openalex.org/W3128430476","https://openalex.org/W4205379698","https://openalex.org/W4293775970","https://openalex.org/W6600175564"],"related_works":["https://openalex.org/W2615021531","https://openalex.org/W4205485413","https://openalex.org/W1979720870","https://openalex.org/W4380147916","https://openalex.org/W2011094784","https://openalex.org/W4367186753","https://openalex.org/W3206860823","https://openalex.org/W2114416272","https://openalex.org/W4361221605","https://openalex.org/W3164053468"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,11,30,39,44,60,78,140],"worst-case":[4],"evaluation":[5,91,115],"complexity":[6,92,116],"of":[7,10,29,38,94,118],"a":[8],"version":[9],"standard":[12],"quadratic":[13],"penalty":[14,80],"method":[15,24,62],"for":[16],"smooth":[17],"nonconvex":[18],"optimization":[19],"problems":[20,108],"with":[21,43],"constraints.":[22],"The":[23],"analysed":[25],"allows":[26],"inexact":[27],"solution":[28],"subproblems":[31],"and":[32,98,138],"do":[33],"not":[34],"require":[35],"prior":[36],"knowledge":[37],"Lipschitz":[40],"constants":[41],"related":[42],"problem.":[45],"When":[46],"an":[47,71,90,114],"approximate":[48],"feasible":[49],"point":[50],"is":[51,57,77,120],"used":[52,103,128],"as":[53,104,129],"starting":[54],"point,":[55,74],"it":[56],"shown":[58],"that":[59],"referred":[61],"takes":[63],"at":[64],"most":[65],"O(log\u2061(\u03c30\u22121\u03f5\u22122))":[66],"outer":[67],"iterations":[68],"to":[69,89],"generate":[70],"\u03f5-approximate":[72],"KKT":[73],"where":[75],"\u03c30":[76],"first":[79],"parameter.":[81],"For":[82,107],"equality":[83,112],"constrained":[84],"problems,":[85],"this":[86],"bound":[87,93,117],"yields":[88],"O(\u03f5\u22124),":[95],"when":[96,122],"\u03c30=\u03f5\u22122":[97],"suitable":[99],"first-order":[100],"methods":[101,125],"are":[102,127,135],"inner":[105,130],"solvers.":[106,131],"having":[109],"only":[110],"linear":[111],"constraints,":[113],"O(\u03f5\u2212(p+1)/p)":[119],"established":[121],"appropriate":[123],"p-order":[124],"(p\u22652)":[126],"Illustrative":[132],"numerical":[133],"results":[134],"also":[136],"presented":[137],"corroborate":[139],"theoretical":[141],"predictions.":[142]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-14T06:11:07.267592","created_date":"2023-03-31T00:00:00"}