{"id":"https://openalex.org/W4391999340","doi":"https://doi.org/10.1007/s10589-023-00549-1","title":"A projected-search interior-point method for nonlinearly constrained optimization","display_name":"A projected-search interior-point method for nonlinearly constrained optimization","publication_year":2024,"publication_date":"2024-02-21","ids":{"openalex":"https://openalex.org/W4391999340","doi":"https://doi.org/10.1007/s10589-023-00549-1"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-023-00549-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-023-00549-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-023-00549-1.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-023-00549-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003732991","display_name":"Philip E. Gill","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip E. Gill","raw_affiliation_strings":["Department of Mathematics, University of California San Diego, La Jolla, CA, 92093-0112, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of California San Diego, La Jolla, CA, 92093-0112, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000843963","display_name":"Minxin Zhang","orcid":"https://orcid.org/0000-0002-2154-9823"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Minxin Zhang","raw_affiliation_strings":["Department of Mathematics, University of California Los Angeles, Los Angeles, CA, 90095, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of California Los Angeles, Los Angeles, CA, 90095, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000843963"],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":2.1284,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.84078975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"88","issue":"1","first_page":"37","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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.9851999878883362,"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/interior-point-method","display_name":"Interior point method","score":0.8272562026977539},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7492595911026001},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.7119705677032471},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6830254197120667},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5952255725860596},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5920945405960083},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5554283857345581},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.4709269404411316},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.46157774329185486},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44848713278770447},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.4325748085975647},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.30058377981185913},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2959292531013489},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.183133065700531}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8272562026977539},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7492595911026001},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.7119705677032471},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6830254197120667},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5952255725860596},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5920945405960083},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5554283857345581},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.4709269404411316},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.46157774329185486},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44848713278770447},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.4325748085975647},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.30058377981185913},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2959292531013489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.183133065700531},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10589-023-00549-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-023-00549-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-023-00549-1.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:coopap:v:88:y:2024:i:1:d:10.1007_s10589-023-00549-1","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-023-00549-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":{"id":"doi:10.1007/s10589-023-00549-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-023-00549-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-023-00549-1.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"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"},{"id":"https://openalex.org/G3161243386","display_name":"Optimization, Differential Equations and Applications","funder_award_id":"0915220","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8506779725","display_name":null,"funder_award_id":"DMS-0915220","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":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4391999340.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1574856455","https://openalex.org/W1965824590","https://openalex.org/W1968553199","https://openalex.org/W1970101292","https://openalex.org/W1971536112","https://openalex.org/W1976385924","https://openalex.org/W1978554456","https://openalex.org/W1984633545","https://openalex.org/W2017666390","https://openalex.org/W2022144657","https://openalex.org/W2033624514","https://openalex.org/W2046222402","https://openalex.org/W2057624533","https://openalex.org/W2081019385","https://openalex.org/W2085137170","https://openalex.org/W2123871098","https://openalex.org/W2149454052","https://openalex.org/W2326806701","https://openalex.org/W2336762304","https://openalex.org/W2781490486","https://openalex.org/W3015765855","https://openalex.org/W4240022917","https://openalex.org/W4251256931","https://openalex.org/W4385978253"],"related_works":["https://openalex.org/W1968991653","https://openalex.org/W1986602928","https://openalex.org/W2371283014","https://openalex.org/W2393133128","https://openalex.org/W2375197257","https://openalex.org/W2081363649","https://openalex.org/W1985698727","https://openalex.org/W4254090244","https://openalex.org/W3207390541","https://openalex.org/W2369920403"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"concerns":[3],"the":[4,33,50,57,61,75,82,109,152,166,174,200,205,225,232],"formulation":[5],"and":[6,52,73,154,179,193],"analysis":[7],"of":[8,35,77,81,111,123,176,202,218],"a":[9,18,24,41,69,95,102,120,147,160,187,216,237],"new":[10,96],"interior-point":[11,21,137],"method":[12,22,26,31,62,148,161,188,226,241],"for":[13,27,40,108,119,134,242],"constrained":[14,124],"optimization":[15,125],"that":[16,45,100,139,149,162,173,189,204,224],"combines":[17],"shifted":[19],"primal-dual":[20,42,136],"with":[23,94,184],"projected-search":[25,97],"bound-constrained":[28],"optimization.":[29,244],"The":[30,86,144,157,170],"involves":[32,163],"computation":[34],"an":[36],"approximate":[37,71,87],"Newton":[38,88],"direction":[39,89,207],"penalty-barrier":[43,113],"function":[44],"incorporates":[46],"shifts":[47,150,164,181],"on":[48,56,165],"both":[49,151,177],"primal":[51,153,167,178],"dual":[53,58,155,180],"variables.":[54,156],"Shifts":[55],"variables":[59,168],"allow":[60],"to":[63,230],"be":[64,209],"safely":[65],"\u201cwarm":[66],"started\u201d":[67],"from":[68,215],"good":[70],"solution":[72],"avoids":[74],"possibility":[76],"very":[78],"large":[79,121],"solutions":[80],"associated":[83],"path-following":[84],"equations.":[85],"is":[90,146,159,190,211,227],"used":[91],"in":[92,182,236],"conjunction":[93,183],"line-search":[98],"algorithm":[99],"employs":[101],"flexible":[103],"non-monotone":[104],"quasi-Armijo":[105],"line":[106],"search":[107,206],"minimization":[110],"each":[112],"function.":[114],"Numerical":[115],"results":[116,130,171],"are":[117,131],"presented":[118],"set":[122,217],"problems.":[126],"For":[127],"comparison":[128],"purposes,":[129],"also":[132],"given":[133],"two":[135],"methods":[138],"do":[140],"not":[141],"use":[142,175],"projection.":[143],"first":[145],"second":[158],"only.":[169],"show":[172],"projection":[185],"gives":[186],"more":[191],"robust":[192],"requires":[194],"significantly":[195],"fewer":[196],"iterations.":[197],"In":[198],"particular,":[199],"number":[201],"times":[203],"must":[208],"computed":[210],"substantially":[212],"reduced.":[213],"Results":[214],"quadratic":[219,233,239],"programming":[220,234,240],"test":[221],"problems":[222],"indicate":[223],"particularly":[228],"well-suited":[229],"solving":[231],"subproblem":[235],"sequential":[238],"nonlinear":[243]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}