{"id":"https://openalex.org/W2033531890","doi":"https://doi.org/10.1137/040605904","title":"A Feasible Active Set QP-Free Method for Nonlinear Programming","display_name":"A Feasible Active Set QP-Free Method for Nonlinear Programming","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2033531890","doi":"https://doi.org/10.1137/040605904","mag":"2033531890"},"language":"en","primary_location":{"id":"doi:10.1137/040605904","is_oa":false,"landing_page_url":"https://doi.org/10.1137/040605904","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/A5100711774","display_name":"Lifeng Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lifeng Chen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100633726","display_name":"Yongli Wang","orcid":"https://orcid.org/0000-0001-8221-451X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yongli Wang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108580579","display_name":"Guoping He","orcid":"https://orcid.org/0000-0003-3239-0667"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guoping He","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8948,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.72686003,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"17","issue":"2","first_page":"401","last_page":"429"},"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.9973999857902527,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7980858087539673},{"id":"https://openalex.org/keywords/active-set-method","display_name":"Active set method","score":0.650980532169342},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6171048283576965},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.6074575781822205},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.592519223690033},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5806309580802917},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5205034613609314},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.46855291724205017},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4243665635585785},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.38135838508605957},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3737713694572449},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11122718453407288},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07925635576248169}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7980858087539673},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.650980532169342},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6171048283576965},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.6074575781822205},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.592519223690033},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5806309580802917},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5205034613609314},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.46855291724205017},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4243665635585785},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.38135838508605957},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3737713694572449},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11122718453407288},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07925635576248169},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/040605904","is_oa":false,"landing_page_url":"https://doi.org/10.1137/040605904","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":[{"score":0.5,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W117082138","https://openalex.org/W1490084264","https://openalex.org/W1508335918","https://openalex.org/W1533744522","https://openalex.org/W1748199557","https://openalex.org/W1899476613","https://openalex.org/W1910642380","https://openalex.org/W1980782931","https://openalex.org/W1980940812","https://openalex.org/W1988641273","https://openalex.org/W1993647205","https://openalex.org/W1994635453","https://openalex.org/W1996701679","https://openalex.org/W2011338916","https://openalex.org/W2032316591","https://openalex.org/W2037179686","https://openalex.org/W2037328914","https://openalex.org/W2046272803","https://openalex.org/W2047515818","https://openalex.org/W2058721622","https://openalex.org/W2067275683","https://openalex.org/W2075184363","https://openalex.org/W2085091825","https://openalex.org/W2088241859","https://openalex.org/W2123871098","https://openalex.org/W2125410188","https://openalex.org/W2130632243","https://openalex.org/W2141640731"],"related_works":["https://openalex.org/W2178472013","https://openalex.org/W4220721387","https://openalex.org/W2022345920","https://openalex.org/W2072581479","https://openalex.org/W2349022982","https://openalex.org/W165108556","https://openalex.org/W1990380242","https://openalex.org/W2970299800","https://openalex.org/W1986943695","https://openalex.org/W1987013673"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,78,91,99,127],"monotone":[3],"descent":[4],"active":[5,38],"set":[6,39,101],"QP-free":[7,71],"method":[8,67,113,163],"for":[9,22,42],"inequality":[10],"constrained":[11],"optimization":[12],"that":[13,161],"ensures":[14],"the":[15,25,28,36,65,109,112,119,123,162,170,177],"feasibility":[16],"of":[17,27,64,116,180],"all":[18],"iterates":[19,23],"and":[20,45,52,77,130,176],"allows":[21],"on":[24],"boundary":[26],"feasible":[29],"set.":[30],"The":[31],"study":[32],"is":[33,146,159,182],"motivated":[34],"by":[35,155],"Facchinei--Fischer--Kanzow":[37],"identification":[40],"technique":[41,145],"nonlinear":[43],"programming":[44],"variational":[46],"inequalities":[47],"[F.":[48],"Facchinei,":[49],"A.":[50],"Fischer,":[51],"C.":[53],"Kanzow,":[54],"SIAM":[55],"J.":[56],"Optim.,":[57],"9":[58],"(1999),":[59],"pp.":[60],"14-32].":[61],"Distinguishing":[62],"features":[63],"proposed":[66],"compared":[68],"with":[69,90],"existing":[70],"methods":[72],"include":[73],"lower":[74],"subproblem":[75],"costs":[76],"fast":[79],"convergence":[80,181],"rate":[81,179],"under":[82,169,184],"milder":[83],"assumptions.":[84],"Specifically,":[85],"four":[86],"reduced":[87],"linear":[88,133,171],"systems":[89,134,153],"common":[92],"coefficient":[93],"matrix":[94],"involving":[95],"only":[96],"constraints":[97],"in":[98],"working":[100,110],"are":[102,135],"solved":[103,136],"at":[104],"each":[105],"iteration.":[106],"To":[107],"determine":[108],"set,":[111],"makes":[114],"use":[115],"multipliers":[117],"from":[118],"last":[120],"iteration,":[121],"eliminating":[122],"need":[124],"to":[125,137,148,166],"compute":[126],"new":[128,144],"estimate,":[129],"no":[131],"additional":[132,186],"select":[138],"linearly":[139],"independent":[140],"constraint":[141,173],"gradients.":[142],"A":[143],"presented":[147],"avoid":[149],"possible":[150],"ill-conditioned":[151],"Newton":[152],"caused":[154],"dual":[156],"degeneracy.":[157],"It":[158],"shown":[160],"converges":[164],"globally":[165],"KKT":[167],"points":[168],"independence":[172],"qualification":[174],"(LICQ),":[175],"asymptotic":[178],"Q-superlinear":[183],"an":[185],"strong":[187],"second-order":[188],"sufficient":[189],"condition":[190],"(SSOSC)":[191],"without":[192],"strict":[193],"complementarity.":[194]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}