{"id":"https://openalex.org/W1967957237","doi":"https://doi.org/10.1137/060674004","title":"An Inexact SQP Method for Equality Constrained Optimization","display_name":"An Inexact SQP Method for Equality Constrained Optimization","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1967957237","doi":"https://doi.org/10.1137/060674004","mag":"1967957237"},"language":"en","primary_location":{"id":"doi:10.1137/060674004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060674004","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@cs.colorado.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"richard@cs.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":["fecurt@gmail.com#TAB#"],"affiliations":[{"raw_affiliation_string":"fecurt@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@dario.ece.northwestern.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"nocedal@dario.ece.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":10.2679,"has_fulltext":false,"cited_by_count":81,"citation_normalized_percentile":{"value":0.98470191,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"19","issue":"1","first_page":"351","last_page":"369"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9973000288009644,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9957000017166138,"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/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.8858383893966675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7230318784713745},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6602175235748291},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6473666429519653},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.6412036418914795},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.6270577907562256},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.554176926612854},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4881058633327484},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4453938603401184},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4387483298778534},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4188436269760132},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.41883131861686707},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4121040403842926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33413058519363403},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.329412579536438},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23209744691848755},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.06986773014068604}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.8858383893966675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7230318784713745},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6602175235748291},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6473666429519653},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.6412036418914795},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.6270577907562256},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.554176926612854},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4881058633327484},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4453938603401184},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4387483298778534},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4188436269760132},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.41883131861686707},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4121040403842926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33413058519363403},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.329412579536438},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23209744691848755},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.06986773014068604},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"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.1137/060674004","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060674004","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.416.4160","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.4160","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/2006/11/1521.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"},{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1516152711","https://openalex.org/W1579057532","https://openalex.org/W1968553199","https://openalex.org/W1971536112","https://openalex.org/W1976685335","https://openalex.org/W1987336415","https://openalex.org/W2004556812","https://openalex.org/W2035072927","https://openalex.org/W2036371636","https://openalex.org/W2041684917","https://openalex.org/W2046351898","https://openalex.org/W2046763850","https://openalex.org/W2059527489","https://openalex.org/W2068696746","https://openalex.org/W2070656412","https://openalex.org/W2085137170","https://openalex.org/W2085919628","https://openalex.org/W2107501462","https://openalex.org/W2126906098","https://openalex.org/W2140153041","https://openalex.org/W3029645440"],"related_works":["https://openalex.org/W574348691","https://openalex.org/W2369920403","https://openalex.org/W298733438","https://openalex.org/W2030310352","https://openalex.org/W2587737421","https://openalex.org/W1976385924","https://openalex.org/W2371283014","https://openalex.org/W2393133128","https://openalex.org/W202562366","https://openalex.org/W2363901946"],"abstract_inverted_index":{"We":[0,60],"present":[1],"an":[2,83],"algorithm":[3,104],"for":[4,33,36],"large-scale":[5,34],"equality":[6],"constrained":[7],"optimization.":[8],"The":[9,87],"method":[10,88],"is":[11,89],"based":[12],"on":[13],"a":[14,66,74,92],"characterization":[15],"of":[16,76,97,102],"inexact":[17,68],"sequential":[18],"quadratic":[19],"programming":[20],"(SQP)":[21],"steps":[22],"that":[23],"can":[24],"ensure":[25],"global":[26,99],"convergence.":[27],"Inexact":[28],"SQP":[29],"methods":[30],"are":[31,108],"needed":[32],"applications":[35],"which":[37],"the":[38,48,77,98,103],"iteration":[39],"matrix":[40],"cannot":[41],"be":[42,53],"explicitly":[43],"formed":[44],"or":[45],"factored":[46],"and":[47,105],"arising":[49],"linear":[50,57],"systems":[51],"must":[52],"solved":[54],"using":[55],"iterative":[56],"algebra":[58],"techniques.":[59],"address":[61],"how":[62],"to":[63],"determine":[64],"when":[65],"given":[67],"step":[69],"makes":[70],"sufficient":[71],"progress":[72],"toward":[73],"solution":[75],"nonlinear":[78],"program,":[79],"as":[80],"measured":[81],"by":[82,91],"exact":[84],"penalty":[85],"function.":[86],"globalized":[90],"line":[93],"search.":[94],"An":[95],"analysis":[96],"convergence":[100],"properties":[101],"numerical":[106],"results":[107],"presented.":[109]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}