{"id":"https://openalex.org/W1969974549","doi":"https://doi.org/10.1137/050626776","title":"Active Set Identification in Nonlinear Programming","display_name":"Active Set Identification in Nonlinear Programming","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1969974549","doi":"https://doi.org/10.1137/050626776","mag":"1969974549"},"language":"en","primary_location":{"id":"doi:10.1137/050626776","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050626776","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/A5034229947","display_name":"Christina Oberlin","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christina Oberlin","raw_affiliation_strings":["University of Wisconsin, Madison"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin, Madison","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046109083","display_name":"Stephen J. Wright","orcid":"https://orcid.org/0000-0001-6815-7379"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen J. Wright","raw_affiliation_strings":["University of Wisconsin, Madison"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin, Madison","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":2.6843,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.88373266,"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":"577","last_page":"605"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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.9955000281333923,"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/T11236","display_name":"Control Systems and Identification","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.745320737361908},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.7238261699676514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6884074211120605},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.6828048825263977},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5962187051773071},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5574768781661987},{"id":"https://openalex.org/keywords/nonlinear-complementarity-problem","display_name":"Nonlinear complementarity problem","score":0.5163453817367554},{"id":"https://openalex.org/keywords/mixed-complementarity-problem","display_name":"Mixed complementarity problem","score":0.45778927206993103},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4484182596206665},{"id":"https://openalex.org/keywords/active-set-method","display_name":"Active set method","score":0.4388899505138397},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.43826133012771606},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4368341267108917},{"id":"https://openalex.org/keywords/solution-set","display_name":"Solution set","score":0.41653379797935486},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3949311375617981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24328604340553284},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.2068602442741394}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.745320737361908},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.7238261699676514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6884074211120605},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.6828048825263977},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5962187051773071},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5574768781661987},{"id":"https://openalex.org/C2778646529","wikidata":"https://www.wikidata.org/wiki/Q16948724","display_name":"Nonlinear complementarity problem","level":4,"score":0.5163453817367554},{"id":"https://openalex.org/C77196050","wikidata":"https://www.wikidata.org/wiki/Q6883962","display_name":"Mixed complementarity problem","level":3,"score":0.45778927206993103},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4484182596206665},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.4388899505138397},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.43826133012771606},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4368341267108917},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.41653379797935486},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3949311375617981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24328604340553284},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2068602442741394},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/050626776","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050626776","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.106.2595","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.2595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.optimization-online.org/DB_FILE/2005/02/1059.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.9283","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.9283","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.wisc.edu/~coberlin/ident2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.146.1248","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.1248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.wisc.edu/~swright/papers/62677.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W171925985","https://openalex.org/W190189919","https://openalex.org/W1969594194","https://openalex.org/W1971536112","https://openalex.org/W1972223440","https://openalex.org/W1973431552","https://openalex.org/W1978115826","https://openalex.org/W2008063657","https://openalex.org/W2011338916","https://openalex.org/W2063176644","https://openalex.org/W2067824962","https://openalex.org/W2072808760","https://openalex.org/W2075194837","https://openalex.org/W2077658674","https://openalex.org/W2078921378","https://openalex.org/W2085137170","https://openalex.org/W2088241859","https://openalex.org/W2111885254","https://openalex.org/W2122587727","https://openalex.org/W2130025383","https://openalex.org/W2162988958","https://openalex.org/W2163319674","https://openalex.org/W2593671840","https://openalex.org/W3012317737","https://openalex.org/W4240823076"],"related_works":["https://openalex.org/W2081101031","https://openalex.org/W2090173761","https://openalex.org/W2067448652","https://openalex.org/W2234791014","https://openalex.org/W2767061585","https://openalex.org/W2360826502","https://openalex.org/W2014045196","https://openalex.org/W2363548947","https://openalex.org/W2361424709","https://openalex.org/W2019849542"],"abstract_inverted_index":{"Techniques":[0],"that":[1,67],"identify":[2],"the":[3,18,31,35,44,59,76,95,115],"active":[4],"constraints":[5,77],"at":[6],"a":[7,10,15,22,81,101],"solution":[8,19],"of":[9,39,97,103],"nonlinear":[11,26],"programming":[12,27],"problem":[13,52,57],"from":[14],"point":[16],"near":[17],"can":[20,47],"be":[21,79],"useful":[23],"adjunct":[24],"to":[25,33,53,78],"algorithms.":[28],"They":[29],"have":[30],"potential":[32],"improve":[34],"local":[36],"convergence":[37],"behavior":[38],"these":[40,98],"algorithms":[41],"and":[42,88],"in":[43,113],"best":[45],"case":[46],"reduce":[48],"an":[49,54],"inequality":[50],"constrained":[51,56],"equality":[55],"with":[58],"same":[60],"solution.":[61],"This":[62],"paper":[63],"describes":[64],"several":[65],"techniques":[66,99],"do":[68],"not":[69,119,126],"require":[70],"good":[71],"Lagrange":[72],"multiplier":[73],"estimates":[74],"for":[75],"available":[80],"priori,":[82],"but":[83],"depend":[84],"only":[85],"on":[86,100],"function":[87],"first":[89],"derivative":[90],"information.":[91],"Computational":[92],"tests":[93,109],"comparing":[94],"effectiveness":[96],"variety":[102],"test":[104],"problems":[105],"are":[106,118],"described.":[107],"Many":[108],"involve":[110],"degenerate":[111],"cases,":[112],"which":[114],"constraint":[116],"gradients":[117],"linearly":[120],"independent":[121],"and/or":[122],"strict":[123],"complementarity":[124],"does":[125],"hold.":[127]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}