{"id":"https://openalex.org/W1239730545","doi":"https://doi.org/10.1137/130912190","title":"An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming","display_name":"An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W1239730545","doi":"https://doi.org/10.1137/130912190","mag":"1239730545"},"language":"en","primary_location":{"id":"doi:10.1137/130912190","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130912190","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/A5045265039","display_name":"A. Auslender","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alfred Auslender","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5045265039"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0062,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73309818,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"25","issue":"3","first_page":"1732","last_page":"1759"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9983000159263611,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9955999851226807,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.9115723371505737},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.8350911140441895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7979447245597839},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.7173382043838501},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5995922684669495},{"id":"https://openalex.org/keywords/cone","display_name":"Cone (formal languages)","score":0.5953262448310852},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.5585348606109619},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.544084906578064},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.48251864314079285},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4768439531326294},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.44882944226264954},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.42171579599380493},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.42054125666618347},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.3846338093280792},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24301716685295105},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.23166242241859436},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.15666037797927856},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15301606059074402},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06887993216514587},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.05623281002044678}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.9115723371505737},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.8350911140441895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7979447245597839},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.7173382043838501},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5995922684669495},{"id":"https://openalex.org/C30014739","wikidata":"https://www.wikidata.org/wiki/Q5159445","display_name":"Cone (formal languages)","level":2,"score":0.5953262448310852},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.5585348606109619},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.544084906578064},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.48251864314079285},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4768439531326294},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.44882944226264954},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.42171579599380493},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.42054125666618347},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.3846338093280792},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24301716685295105},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.23166242241859436},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.15666037797927856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15301606059074402},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06887993216514587},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.05623281002044678},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/130912190","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130912190","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":[{"display_name":"Peace, Justice and strong institutions","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W8821478","https://openalex.org/W170686111","https://openalex.org/W1968363522","https://openalex.org/W1986468691","https://openalex.org/W1992726305","https://openalex.org/W2005865517","https://openalex.org/W2006449495","https://openalex.org/W2006905759","https://openalex.org/W2008832947","https://openalex.org/W2019176559","https://openalex.org/W2020061185","https://openalex.org/W2032266076","https://openalex.org/W2034145183","https://openalex.org/W2039016407","https://openalex.org/W2042860556","https://openalex.org/W2051968500","https://openalex.org/W2055883125","https://openalex.org/W2056868378","https://openalex.org/W2058021091","https://openalex.org/W2060790656","https://openalex.org/W2062903625","https://openalex.org/W2066459185","https://openalex.org/W2085919628","https://openalex.org/W2124643039","https://openalex.org/W2127838862","https://openalex.org/W2169768001","https://openalex.org/W2174004662"],"related_works":["https://openalex.org/W2348903644","https://openalex.org/W2912522929","https://openalex.org/W4231773446","https://openalex.org/W2941716933","https://openalex.org/W2069798394","https://openalex.org/W1544933314","https://openalex.org/W3143791848","https://openalex.org/W2771160919","https://openalex.org/W4301659259","https://openalex.org/W2597153870"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"exact":[4],"penalty":[5,131],"method":[6,37],"for":[7,40,59,137],"solving":[8,51],"optimization":[9],"problems":[10],"with":[11],"very":[12],"general":[13],"constraints":[14],"covering,":[15],"in":[16,96],"particular,":[17,97],"nonlinear":[18],"programming":[19,22,27],"(NLP),":[20],"semidefinite":[21],"(SDP),":[23],"and":[24,42,136],"second-order":[25],"cone":[26,36,57],"(SOCP).":[28],"The":[29],"algorithm":[30],"is":[31,69,86,93,102,111,124,144],"called":[32],"the":[33,44,83,89,99,114,128],"sequential":[34,72],"linear":[35,56],"(SLCM)":[38],"because":[39],"SDP":[41],"SOCP":[43],"main":[45],"cost":[46],"of":[47,91,130,141],"computation":[48],"amounts":[49],"to":[50,66],"at":[52],"each":[53],"iteration":[54],"a":[55,71,138,147],"program":[58,74],"which":[60,80],"efficient":[61],"solvers":[62],"are":[63,117],"available.":[64],"Restricted":[65],"NLP,":[67],"SLCM":[68],"exactly":[70],"quadratic":[73],"method.":[75],"Under":[76],"two":[77,105],"basic":[78],"conditions":[79],"concern":[81],"only":[82],"data,":[84],"it":[85,110,123,143],"proved":[87,112,145],"that":[88,113,121,127,146],"sequence":[90,129],"iterates":[92],"bounded.":[94],"Furthermore,":[95],"when":[98],"feasible":[100],"set":[101],"nonempty,":[103],"under":[104],"additional":[106],"constraint":[107],"qualification":[108],"conditions,":[109],"cluster":[115],"points":[116],"stationary":[118],"points.":[119],"In":[120],"case,":[122],"established":[125],"also":[126],"parameters":[132],"eventually":[133],"stays":[134],"constant,":[135],"particular":[139],"class":[140],"data":[142],"unit":[148],"step":[149],"length":[150],"can":[151],"be":[152],"obtained.":[153]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-24T06:17:17.354583","created_date":"2025-10-10T00:00:00"}