{"id":"https://openalex.org/W1500624306","doi":"https://doi.org/10.1109/cdc.2002.1184597","title":"Inequality/equality constrained optimization: a quadratically and globally convergent feasibility method","display_name":"Inequality/equality constrained optimization: a quadratically and globally convergent feasibility method","publication_year":2003,"publication_date":"2003-08-27","ids":{"openalex":"https://openalex.org/W1500624306","doi":"https://doi.org/10.1109/cdc.2002.1184597","mag":"1500624306"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2002.1184597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2002.1184597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE Conference on Decision and Control, 2002.","raw_type":"proceedings-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/A5108522078","display_name":"B.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":"B.J. Driessen","raw_affiliation_strings":["Mechanical and AeroSpace Engineering Department, University of Alabama, Huntsville, AL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mechanical and AeroSpace Engineering Department, University of Alabama, Huntsville, AL, 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":"N. Sadegh","raw_affiliation_strings":["Department of Mechanical Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Georgia Institute of Technology, Atlanta, GA, USA","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.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06153397,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"759","last_page":"768"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"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.9991000294685364,"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.9987000226974487,"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.992900013923645,"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.9065325856208801},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7433123588562012},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.6896469593048096},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6681391000747681},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6076251864433289},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5681450963020325},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5416725873947144},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5251326560974121},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.48397135734558105},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.45639416575431824},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4332340955734253},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.24960172176361084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22157630324363708}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.9065325856208801},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7433123588562012},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.6896469593048096},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6681391000747681},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6076251864433289},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5681450963020325},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5416725873947144},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5251326560974121},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.48397135734558105},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.45639416575431824},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4332340955734253},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.24960172176361084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22157630324363708},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","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/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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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.1109/cdc.2002.1184597","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2002.1184597","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE Conference on Decision and Control, 2002.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.6000000238418579,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["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/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/W2147769470","https://openalex.org/W2319180122","https://openalex.org/W2798766386","https://openalex.org/W4250415053"],"related_works":["https://openalex.org/W1968991653","https://openalex.org/W4206704743","https://openalex.org/W2112847829","https://openalex.org/W4313119266","https://openalex.org/W4293088966","https://openalex.org/W2164807043","https://openalex.org/W2030310352","https://openalex.org/W2371283014","https://openalex.org/W2393133128","https://openalex.org/W2022619808"],"abstract_inverted_index":{"We":[0,37,58],"present":[1],"an":[2,32,138],"analytical":[3,61],"robustness":[4,62],"comparison":[5],"of":[6,42,50,64,77,92,105,117,140],"two":[7],"methods":[8,17],"for":[9,52],"inequality/equality":[10],"constrained":[11],"optimization":[12],"or":[13,109],"nonlinear":[14],"programming.":[15],"The":[16,71],"compared":[18],"are":[19,89],"(1)":[20],"a":[21,43,53,101,106,110,132],"feasibility":[22],"method":[23],"(FM)":[24],"and":[25,114],"(2)":[26],"rudimentary":[27],"sequential":[28],"quadratic":[29,115],"programming":[30],"with":[31],"L1":[33],"merit":[34],"function":[35,108],"(L1-SQP).":[36],"then":[38],"also":[39],"make":[40],"note":[41],"global":[44],"convergence":[45,116],"result":[46],"(similar":[47],"to":[48,98,100,126,137],"that":[49,95],"FM)":[51],"new":[54],"filter-type":[55,68],"SQP":[56,69],"algorithm.":[57,70],"claim":[59],"no":[60],"advantage":[63],"FM":[65,118],"over":[66],"the":[67],"problem":[72],"statement":[73],"assumptions":[74],"include":[75],"non-stationarity":[76],"constraint":[78,84],"error":[79],"norms":[80],"except":[81],"at":[82],"zero":[83],"error,":[85],"without":[86],"which":[87],"we":[88],"not":[90],"aware":[91],"any":[93],"algorithm":[94],"is":[96,119,124],"guaranteed":[97],"converge":[99],"tolerance-feasible":[102],"stationary":[103],"point":[104],"penalty":[107],"Kuhn-Tucker":[111],"point.":[112],"Global":[113],"proved":[120],"analytically.":[121],"Rudimentary":[122],"L1-SQP":[123],"shown":[125],"exhibit":[127],"potential":[128],"failure":[129],"even":[130],"from":[131],"feasible":[133],"starting":[134],"point,":[135],"due":[136],"onset":[139],"infeasible":[141],"sub":[142],"problems.":[143]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}