{"id":"https://openalex.org/W2075225328","doi":"https://doi.org/10.1080/10556780801996228","title":"Implementation of a robust SQP algorithm","display_name":"Implementation of a robust SQP algorithm","publication_year":2008,"publication_date":"2008-05-12","ids":{"openalex":"https://openalex.org/W2075225328","doi":"https://doi.org/10.1080/10556780801996228","mag":"2075225328"},"language":"en","primary_location":{"id":"doi:10.1080/10556780801996228","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780801996228","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/A5044727714","display_name":"Brian C. Fabien","orcid":"https://orcid.org/0000-0002-0663-021X"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Brian C. Fabien","raw_affiliation_strings":["Department of Mechanical Engineering , University of Washington , Seattle, WA, USA","Department of Mechanical Engineering University of  Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering , University of Washington , Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"Department of Mechanical Engineering University of  Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044727714"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":0.5065,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.68959235,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":"6","first_page":"827","last_page":"846"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9886999726295471,"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.8499135971069336},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6778006553649902},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.6362051963806152},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6332374811172485},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.6198841333389282},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6098121404647827},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5896372199058533},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.566152036190033},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4597707986831665},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45275118947029114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4498337209224701},{"id":"https://openalex.org/keywords/robust-optimization","display_name":"Robust optimization","score":0.4452736973762512},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4447743594646454},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4409335255622864},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4247533082962036},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4204060137271881},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.35488444566726685},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.25724104046821594}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.8499135971069336},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6778006553649902},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.6362051963806152},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6332374811172485},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.6198841333389282},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6098121404647827},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5896372199058533},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.566152036190033},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4597707986831665},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45275118947029114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4498337209224701},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.4452736973762512},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4447743594646454},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4409335255622864},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4247533082962036},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4204060137271881},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.35488444566726685},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.25724104046821594},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/10556780801996228","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780801996228","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":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W8821478","https://openalex.org/W35651078","https://openalex.org/W79353284","https://openalex.org/W135663343","https://openalex.org/W147998453","https://openalex.org/W1669104078","https://openalex.org/W1748199557","https://openalex.org/W1967942590","https://openalex.org/W1969418881","https://openalex.org/W1970101292","https://openalex.org/W1981158318","https://openalex.org/W2001070629","https://openalex.org/W2033623955","https://openalex.org/W2033758151","https://openalex.org/W2043430160","https://openalex.org/W2066237909","https://openalex.org/W2085919628","https://openalex.org/W2098918699","https://openalex.org/W2149416133","https://openalex.org/W2159307101","https://openalex.org/W2527781137","https://openalex.org/W2884670864"],"related_works":["https://openalex.org/W2030310352","https://openalex.org/W1968991653","https://openalex.org/W4206704743","https://openalex.org/W4313119266","https://openalex.org/W2371283014","https://openalex.org/W2393133128","https://openalex.org/W2164807043","https://openalex.org/W2375197257","https://openalex.org/W2369920403","https://openalex.org/W2132081963"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"implementation":[4,116],"of":[5,15,107,151],"a":[6,24,52,71,87,113],"sequential":[7],"quadratic":[8,55],"programming":[9,17,56],"(SQP)":[10],"algorithm":[11,65,109],"for":[12,43],"the":[13,21,27,34,44,62,80,102,108,132,149],"solution":[14,25],"nonlinear":[16],"(NLP)":[18],"problems.":[19,158],"In":[20],"proposed":[22],"algorithm,":[23],"to":[26,91,100,120,154],"NLP":[28],"problem":[29,76],"is":[30,48,110,118],"found":[31],"by":[32,50,69,85,96],"minimizing":[33],"L":[35],"1":[36],"exact":[37],"penalty":[38,45],"function.":[39],"The":[40,105,134],"search":[41,90],"direction":[42],"function":[46],"minimization":[47],"determined":[49],"solving":[51,70],"strictly":[53,73],"convex":[54],"(QP)":[57],"problem.":[58],"Here,":[59],"we":[60],"make":[61],"basic":[63],"SQP":[64],"more":[66],"robust":[67],"(i)":[68],"relaxed,":[72],"convex,":[74],"QP":[75],"in":[77,131],"cases":[78],"where":[79],"constraints":[81],"are":[82],"inconsistent,":[83],"(ii)":[84],"performing":[86],"non-monotone":[88,140],"line":[89,141],"improve":[92],"efficiency,":[93],"and":[94,124,143],"(iii)":[95],"using":[97],"second-order":[98,144],"corrections":[99,145],"avoid":[101],"Maratos":[103],"effect.":[104],"robustness":[106],"demonstrated":[111],"via":[112],"C":[114],"language":[115],"that":[117,128,138],"applied":[119],"numerous":[121],"parameter":[122,156],"optimization":[123,157],"optimal":[125],"control":[126],"problems":[127],"have":[129],"appeared":[130],"literature.":[133],"results":[135],"obtained":[136],"show":[137],"both":[139],"searches":[142],"can":[146],"significantly":[147],"reduce":[148],"amount":[150],"work":[152],"required":[153],"solve":[155]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}