{"id":"https://openalex.org/W2006449495","doi":"https://doi.org/10.1137/080738222","title":"Infeasibility Detection and SQP Methods for Nonlinear Optimization","display_name":"Infeasibility Detection and SQP Methods for Nonlinear Optimization","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2006449495","doi":"https://doi.org/10.1137/080738222","mag":"2006449495"},"language":"en","primary_location":{"id":"doi:10.1137/080738222","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080738222","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/A5110661221","display_name":"Richard H. Byrd","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Richard H. Byrd","raw_affiliation_strings":["Richard.Byrd@colorado.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"Richard.Byrd@colorado.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005028153","display_name":"Frank E. Curtis","orcid":"https://orcid.org/0000-0001-7214-9187"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frank E. Curtis","raw_affiliation_strings":["frank.e.curtis@gmail.com#TAB#"],"affiliations":[{"raw_affiliation_string":"frank.e.curtis@gmail.com#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081856145","display_name":"Jorge Nocedal","orcid":"https://orcid.org/0000-0002-9662-2730"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jorge Nocedal","raw_affiliation_strings":["nocedal@eecs.northwestern.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"nocedal@eecs.northwestern.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110661221"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.867,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.98551381,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"20","issue":"5","first_page":"2281","last_page":"2299"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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":1.0,"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.9976999759674072,"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.9965000152587891,"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/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.8222874402999878},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7675062417984009},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6793548464775085},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6337680220603943},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.6172301173210144},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5286703109741211},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5266680121421814},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5215578079223633},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48274677991867065},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.47027426958084106},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43601712584495544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2870830297470093}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.8222874402999878},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7675062417984009},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6793548464775085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6337680220603943},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.6172301173210144},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5286703109741211},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5266680121421814},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5215578079223633},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48274677991867065},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.47027426958084106},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43601712584495544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2870830297470093},{"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/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},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/080738222","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080738222","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.154.5264","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.5264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.northwestern.edu/~nocedal/PDFfiles/infi.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W8821478","https://openalex.org/W172672465","https://openalex.org/W180478659","https://openalex.org/W1516152711","https://openalex.org/W1573176827","https://openalex.org/W1692381826","https://openalex.org/W1966095601","https://openalex.org/W1974153211","https://openalex.org/W1976086748","https://openalex.org/W1985514811","https://openalex.org/W2002489472","https://openalex.org/W2003140178","https://openalex.org/W2005604902","https://openalex.org/W2013683432","https://openalex.org/W2022144657","https://openalex.org/W2048799772","https://openalex.org/W2053661713","https://openalex.org/W2068484625","https://openalex.org/W2072274072","https://openalex.org/W2075194837","https://openalex.org/W2077658674","https://openalex.org/W2081904511","https://openalex.org/W2085137170","https://openalex.org/W2090395694","https://openalex.org/W2091724753","https://openalex.org/W2097415784","https://openalex.org/W2108814972","https://openalex.org/W2112838397","https://openalex.org/W2125410188","https://openalex.org/W2163319674","https://openalex.org/W2267452712","https://openalex.org/W2610216665","https://openalex.org/W2734531110","https://openalex.org/W2798766386","https://openalex.org/W2903329078","https://openalex.org/W3012317737","https://openalex.org/W3029645440","https://openalex.org/W3173138228","https://openalex.org/W3216976781"],"related_works":["https://openalex.org/W1968991653","https://openalex.org/W2092346180","https://openalex.org/W2030310352","https://openalex.org/W2025795821","https://openalex.org/W2589412911","https://openalex.org/W2147769470","https://openalex.org/W2081101031","https://openalex.org/W2006449495","https://openalex.org/W2313503396","https://openalex.org/W3120891614"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,39,83,87,108,112],"need":[4],"for":[5],"nonlinear":[6],"programming":[7,29],"algorithms":[8],"that":[9,37],"provide":[10],"fast":[11],"local":[12],"convergence":[13,52,85],"guarantees":[14],"regardless":[15],"of":[16,53,72,79,86,90,111],"whether":[17],"a":[18,26,65,77,101],"problem":[19,66,102],"is":[20,61,67,76,103],"feasible":[21,115],"or":[22],"infeasible.":[23,104],"We":[24],"present":[25],"sequential":[27],"quadratic":[28],"method":[30,113],"derived":[31],"from":[32],"an":[33,55,58,93],"exact":[34],"penalty":[35,40],"approach":[36],"adjusts":[38],"parameter":[41],"automatically,":[42],"when":[43,64,100],"appropriate,":[44],"to":[45,57,92],"emphasize":[46],"feasibility":[47],"over":[48],"optimality.":[49],"The":[50,69],"superlinear":[51,84],"such":[54],"algorithm":[56,91],"optimal":[59],"solution":[60],"well":[62],"known":[63],"feasible.":[68],"main":[70],"contribution":[71],"this":[73],"paper,":[74],"however,":[75],"set":[78],"conditions":[80],"under":[81],"which":[82],"same":[88],"type":[89],"infeasible":[94,117],"stationary":[95],"point":[96],"can":[97],"be":[98],"guaranteed":[99],"Numerical":[105],"experiments":[106],"illustrate":[107],"practical":[109],"behavior":[110],"on":[114],"and":[116],"problems.":[118]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}