{"id":"https://openalex.org/W3015765855","doi":"https://doi.org/10.1137/19m1247425","title":"A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization","display_name":"A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3015765855","doi":"https://doi.org/10.1137/19m1247425","mag":"3015765855"},"language":"en","primary_location":{"id":"doi:10.1137/19m1247425","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1247425","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/A5003732991","display_name":"Philip E. Gill","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Philip E. Gill","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066151990","display_name":"Vyacheslav Kungurtsev","orcid":"https://orcid.org/0000-0003-2229-8824"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vyacheslav Kungurtsev","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082367556","display_name":"Daniel P. Robinson","orcid":"https://orcid.org/0000-0003-0251-4227"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel P. Robinson","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003732991"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9451,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.9055794,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"30","issue":"2","first_page":"1067","last_page":"1093"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9991999864578247,"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.9980000257492065,"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/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.8171002268791199},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.8151488900184631},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7842890024185181},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.7759298086166382},{"id":"https://openalex.org/keywords/limit-point","display_name":"Limit point","score":0.7495724558830261},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7457299828529358},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6844910383224487},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5510408282279968},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5377794504165649},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5264621376991272},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.5056359767913818},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.505634069442749},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.48493340611457825},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4842236042022705},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4739561080932617},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46122437715530396},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.45750144124031067},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.441118061542511},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.42968618869781494},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4247104525566101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1529998779296875},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08259603381156921}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.8171002268791199},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8151488900184631},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7842890024185181},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.7759298086166382},{"id":"https://openalex.org/C63548660","wikidata":"https://www.wikidata.org/wiki/Q858223","display_name":"Limit point","level":2,"score":0.7495724558830261},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7457299828529358},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6844910383224487},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5510408282279968},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5377794504165649},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5264621376991272},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.5056359767913818},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.505634069442749},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.48493340611457825},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4842236042022705},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4739561080932617},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46122437715530396},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.45750144124031067},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.441118061542511},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.42968618869781494},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4247104525566101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1529998779296875},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08259603381156921},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/19m1247425","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1247425","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":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6100000143051147}],"awards":[{"id":"https://openalex.org/G1812227151","display_name":null,"funder_award_id":"DMS-1361421","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1970670592","display_name":null,"funder_award_id":"DMS-1318480","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1482453036","https://openalex.org/W1579057532","https://openalex.org/W1748199557","https://openalex.org/W1968553199","https://openalex.org/W1970101292","https://openalex.org/W1970687372","https://openalex.org/W1971536112","https://openalex.org/W1976385924","https://openalex.org/W1978554456","https://openalex.org/W1996525837","https://openalex.org/W2014746566","https://openalex.org/W2022144657","https://openalex.org/W2027507632","https://openalex.org/W2032756980","https://openalex.org/W2037903701","https://openalex.org/W2042360648","https://openalex.org/W2047515818","https://openalex.org/W2050267927","https://openalex.org/W2066119044","https://openalex.org/W2069671092","https://openalex.org/W2081019385","https://openalex.org/W2085137170","https://openalex.org/W2088765246","https://openalex.org/W2117869333","https://openalex.org/W2123871098","https://openalex.org/W2149454052","https://openalex.org/W2247801419","https://openalex.org/W2336980064","https://openalex.org/W2781490486"],"related_works":["https://openalex.org/W4312559341","https://openalex.org/W2800025289","https://openalex.org/W1975123909","https://openalex.org/W2889381551","https://openalex.org/W2015399832","https://openalex.org/W120058203","https://openalex.org/W2067275683","https://openalex.org/W1966236941","https://openalex.org/W1996676734","https://openalex.org/W3092127437"],"abstract_inverted_index":{"In":[0,49],"nonlinearly":[1],"constrained":[2],"optimization,":[3],"penalty":[4],"methods":[5,16],"provide":[6,17],"an":[7,18,70],"effective":[8,19],"strategy":[9],"for":[10,21,30],"handling":[11],"equality":[12],"constraints,":[13],"while":[14],"barrier":[15],"approach":[20],"the":[22,59,97,115,124,129,140,143],"treatment":[23],"of":[24,58,61,123,131,142],"inequality":[25],"constraints.":[26],"A":[27],"new":[28],"algorithm":[29],"nonlinear":[31],"optimization":[32],"is":[33,52,68,87,96,107,117],"proposed":[34],"based":[35],"on":[36],"minimizing":[37],"a":[38,55,75,88,92,120,132,147],"shifted":[39,121],"primal-dual":[40,125],"penalty-barrier":[41],"function.":[42],"Certain":[43],"global":[44],"convergence":[45],"properties":[46],"are":[47,136],"established.":[48],"particular,":[50],"it":[51,81],"shown":[53,109],"that":[54,67,95,110,138],"limit":[56],"point":[57,73,90],"sequence":[60],"iterates":[62],"may":[63],"always":[64],"be":[65],"found":[66],"either":[69],"infeasible":[71],"stationary":[72],"or":[74],"complementary":[76],"approximate":[77],"Karush--Kuhn--Tucker":[78,89],"point;":[79],"i.e.,":[80],"satisfies":[82],"reasonable":[83],"stopping":[84],"criteria":[85],"and":[86],"under":[91,111],"regularity":[93],"condition":[94],"weakest":[98],"constraint":[99],"qualification":[100],"associated":[101],"with":[102],"sequential":[103],"optimality":[104],"conditions.":[105],"It":[106],"also":[108],"suitable":[112],"additional":[113],"assumptions,":[114],"method":[116,127,144],"equivalent":[118],"to":[119,146],"variant":[122],"path-following":[126],"in":[128],"neighborhood":[130],"solution.":[133],"Numerical":[134],"examples":[135],"provided":[137],"illustrate":[139],"performance":[141],"compared":[145],"widely":[148],"used":[149],"conventional":[150],"interior-point":[151],"method.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}