{"id":"https://openalex.org/W1997794865","doi":"https://doi.org/10.1080/1055678021000049372","title":"Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming","display_name":"Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1997794865","doi":"https://doi.org/10.1080/1055678021000049372","mag":"1997794865"},"language":"en","primary_location":{"id":"doi:10.1080/1055678021000049372","is_oa":false,"landing_page_url":"https://doi.org/10.1080/1055678021000049372","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5108546929","display_name":"Brian J. Driessen","orcid":null},"institutions":[{"id":"https://openalex.org/I82495205","display_name":"University of Alabama in Huntsville","ror":"https://ror.org/02zsxwr40","country_code":"US","type":"education","lineage":["https://openalex.org/I82495205"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian J. Driessen","raw_affiliation_strings":["Mechanical Aerospace Engineering Department , University of Alabama in Huntsville , Huntsville, AL, 35899, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mechanical Aerospace Engineering Department , University of Alabama in Huntsville , Huntsville, AL, 35899, USA","institution_ids":["https://openalex.org/I82495205"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039658470","display_name":"Nader Sadegh","orcid":"https://orcid.org/0000-0003-1117-6311"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nader Sadegh","raw_affiliation_strings":["Department of Mechanical Engineering , Georgia Institute of Technology , Atlanta, GA, 30332","Department of Mechanical Engineering, Georgia Institute of Technology, Atlanta, Ga. 30332"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering , Georgia Institute of Technology , Atlanta, GA, 30332","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Department of Mechanical Engineering, Georgia Institute of Technology, Atlanta, Ga. 30332","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.522,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.64409938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"4","first_page":"701","last_page":"716"},"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/T11749","display_name":"Iterative Learning Control Systems","score":0.9980999827384949,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.995199978351593,"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.9291976690292358},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7717936038970947},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6699485778808594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5994613170623779},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5860201716423035},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5822430849075317},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5661827325820923},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4615362584590912},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.42890626192092896},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.26506245136260986}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.9291976690292358},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7717936038970947},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6699485778808594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5994613170623779},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5860201716423035},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5822430849075317},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5661827325820923},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4615362584590912},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.42890626192092896},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.26506245136260986},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/1055678021000049372","is_oa":false,"landing_page_url":"https://doi.org/10.1080/1055678021000049372","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.5799999833106995}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1562327279","https://openalex.org/W1583218760","https://openalex.org/W1747911365","https://openalex.org/W1831845460","https://openalex.org/W1975602747","https://openalex.org/W1979102995","https://openalex.org/W1998031316","https://openalex.org/W2030543448","https://openalex.org/W2036281655","https://openalex.org/W2048799772","https://openalex.org/W2109776644","https://openalex.org/W2113395637","https://openalex.org/W2127931526","https://openalex.org/W2139089460","https://openalex.org/W2144901149","https://openalex.org/W2146396918","https://openalex.org/W2798766386","https://openalex.org/W4254313632","https://openalex.org/W4301206608"],"related_works":["https://openalex.org/W4206704743","https://openalex.org/W436931041","https://openalex.org/W1495847109","https://openalex.org/W2019128690","https://openalex.org/W2390817143","https://openalex.org/W4254090244","https://openalex.org/W2030310352","https://openalex.org/W2106813160","https://openalex.org/W2355743697","https://openalex.org/W2048799772"],"abstract_inverted_index":{"In":[0],"this":[1],"work":[2],"we":[3,64,94],"present":[4],"an":[5,35,143],"analytical":[6,67],"robustness":[7,68],"comparison":[8],"of":[9,45,55,70,83,98,112,122,145],"two":[10],"methods":[11,20],"for":[12,57],"inequality-equality":[13],"constrained":[14],"optimization":[15],"or":[16,116],"nonlinear":[17],"programming.":[18],"The":[19,77],"compared":[21],"are":[22,95],"(1)":[23],"a":[24,46,58,108,113,117,137],"Feasibility":[25],"Method":[26],"(FM)":[27],"and":[28],"(2)":[29],"rudimentary":[30],"sequential":[31],"quadratic":[32],"programming":[33],"with":[34],"L1":[36],"merit":[37],"function":[38,115],"(L1-SQP).":[39],"We":[40],"then":[41],"also":[42],"make":[43],"note":[44],"very":[47],"recent":[48],"global":[49],"convergence":[50,121],"result":[51],"(similar":[52],"to":[53,105,107,131,142],"that":[54,101],"FM)":[56],"new":[59],"Filter-type":[60,74],"SQP":[61,75],"algorithm.":[62,76],"And,":[63],"claim":[65],"no":[66],"advantage":[69],"FM":[71,123],"over":[72],"the":[73],"problem":[78],"statement":[79],"assumptions":[80],"include":[81],"nonstationarity":[82],"constraint":[84,90],"error":[85],"norms":[86],"except":[87],"at":[88],"zero":[89],"error,":[91],"without":[92],"which":[93],"not":[96],"aware":[97],"any":[99],"algorithm":[100],"is":[102,124,129],"provably":[103],"guaranteed":[104],"converge":[106],"tolerance-feasible":[109],"stationary":[110],"point":[111],"penalty":[114],"Kuhn-Tucker":[118],"point.":[119],"Global":[120],"proved":[125],"analytically.":[126],"Rudimentary":[127],"L1-SQP":[128],"shown":[130],"exhibit":[132],"potential":[133],"failure":[134],"even":[135],"from":[136],"feasible":[138],"starting":[139],"point,":[140],"due":[141],"onset":[144],"infeasible":[146],"subproblems.":[147]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}