{"id":"https://openalex.org/W2039132125","doi":"https://doi.org/10.1137/050625977","title":"Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints","display_name":"Loss of Superlinear Convergence for an SQP-Type Method with Conic Constraints","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2039132125","doi":"https://doi.org/10.1137/050625977","mag":"2039132125"},"language":"en","primary_location":{"id":"doi:10.1137/050625977","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050625977","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/A5057375078","display_name":"Moritz Diehl","orcid":"https://orcid.org/0000-0001-6556-8252"},"institutions":[{"id":"https://openalex.org/I223822909","display_name":"Heidelberg University","ror":"https://ror.org/038t36y30","country_code":"DE","type":"education","lineage":["https://openalex.org/I223822909"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Moritz Diehl","raw_affiliation_strings":["Heidelberg University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Heidelberg University","institution_ids":["https://openalex.org/I223822909"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015422470","display_name":"Florian Jarre","orcid":"https://orcid.org/0000-0003-3458-123X"},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Florian Jarre","raw_affiliation_strings":["University of Dusseldorf;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Dusseldorf;","institution_ids":["https://openalex.org/I44260953"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010139429","display_name":"Christoph H. Vogelbusch","orcid":null},"institutions":[{"id":"https://openalex.org/I44260953","display_name":"Heinrich Heine University D\u00fcsseldorf","ror":"https://ror.org/024z2rq82","country_code":"DE","type":"education","lineage":["https://openalex.org/I44260953"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph H. Vogelbusch","raw_affiliation_strings":["University of Dusseldorf;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Dusseldorf;","institution_ids":["https://openalex.org/I44260953"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7895,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.83808323,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"16","issue":"4","first_page":"1201","last_page":"1210"},"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9990000128746033,"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.9969000220298767,"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.916084885597229},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.7929601669311523},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6923357248306274},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6921809315681458},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5549792647361755},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5088010430335999},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49692824482917786},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.49267154932022095},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.4607909619808197},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4576385021209717},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.35037124156951904},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3270733952522278},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.3109305500984192},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.13819989562034607}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.916084885597229},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.7929601669311523},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6923357248306274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6921809315681458},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5549792647361755},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5088010430335999},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49692824482917786},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.49267154932022095},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.4607909619808197},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4576385021209717},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.35037124156951904},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3270733952522278},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3109305500984192},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.13819989562034607},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/050625977","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050625977","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1573176827","https://openalex.org/W1967073510","https://openalex.org/W1986468691","https://openalex.org/W2055506505","https://openalex.org/W2066459185","https://openalex.org/W2161496432","https://openalex.org/W4246146212"],"related_works":["https://openalex.org/W3199026565","https://openalex.org/W4323321439","https://openalex.org/W3124564720","https://openalex.org/W2952330476","https://openalex.org/W2180827833","https://openalex.org/W4293777484","https://openalex.org/W2588229150","https://openalex.org/W4206704743","https://openalex.org/W2031269429","https://openalex.org/W3035234178"],"abstract_inverted_index":{"In":[0],"this":[1,17],"short":[2],"note":[3],"we":[4,37,70],"consider":[5],"a":[6,20,52,61,80,100,112],"sequential":[7],"quadratic":[8],"programming":[9],"(SQP)--type":[10],"method":[11,18,23,75],"with":[12,19,76],"conic":[13,27,68,77],"subproblems":[14,43,78],"and":[15,50,66],"compare":[16],"standard":[21,86],"SQP":[22,74,87,94],"in":[24,111],"which":[25],"the":[26,58,73,104,108],"constraint":[28],"is":[29,97],"linearized":[30],"at":[31],"each":[32],"step.":[33],"For":[34],"both":[35],"approaches":[36],"restrict":[38],"our":[39],"attention":[40],"to":[41,48],"convex":[42],"since":[44],"these":[45],"are":[46],"easy":[47],"solve":[49],"guarantee":[51],"certain":[53],"global":[54],"descent":[55],"property.":[56],"Using":[57],"example":[59],"of":[60,83,103,107],"simple":[62],"nonlinear":[63],"program":[64],"(NLP)":[65],"its":[67],"reformulation":[69],"show":[71],"that":[72,96],"displays":[79],"slower":[81,114],"rate":[82],"convergence":[84],"than":[85],"methods.":[88],"We":[89],"then":[90],"explain":[91],"why":[92],"an":[93],"subproblem":[95],"based":[98],"on":[99],"better":[101],"approximation":[102],"feasible":[105],"set":[106],"NLP":[109],"results":[110],"much":[113],"algorithm.":[115]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}