{"id":"https://openalex.org/W3133528461","doi":"https://doi.org/10.1109/lcsys.2021.3083467","title":"A Sequential Convex Programming Approach to Solving Quadratic Programs and Optimal Control Problems With Linear Complementarity Constraints","display_name":"A Sequential Convex Programming Approach to Solving Quadratic Programs and Optimal Control Problems With Linear Complementarity Constraints","publication_year":2021,"publication_date":"2021-05-24","ids":{"openalex":"https://openalex.org/W3133528461","doi":"https://doi.org/10.1109/lcsys.2021.3083467","mag":"3133528461"},"language":"en","primary_location":{"id":"doi:10.1109/lcsys.2021.3083467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2021.3083467","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2103.05965","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jonas Hall","orcid":"https://orcid.org/0000-0002-4435-5669"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jonas Hall","raw_affiliation_strings":["Department of Microsystems Engineering (IMTEK), University of Freiburg, Freiburg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-4435-5669","affiliations":[{"raw_affiliation_string":"Department of Microsystems Engineering (IMTEK), University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Armin Nurkanovi\u0107","orcid":"https://orcid.org/0000-0002-9796-4302"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Armin Nurkanovi\u0107","raw_affiliation_strings":["Department of Microsystems Engineering (IMTEK), University of Freiburg, Freiburg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9796-4302","affiliations":[{"raw_affiliation_string":"Department of Microsystems Engineering (IMTEK), University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Florian Messerer","orcid":"https://orcid.org/0000-0002-6984-9585"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Florian Messerer","raw_affiliation_strings":["Department of Microsystems Engineering (IMTEK), University of Freiburg, Freiburg, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6984-9585","affiliations":[{"raw_affiliation_string":"Department of Microsystems Engineering (IMTEK), University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":null,"display_name":"Moritz Diehl","orcid":"https://orcid.org/0000-0001-6556-8252"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Moritz Diehl","raw_affiliation_strings":["Department of Microsystems Engineering (IMTEK) and Department of Mathematics, University of Freiburg, Freiburg, Germany"],"raw_orcid":"https://orcid.org/0000-0001-6556-8252","affiliations":[{"raw_affiliation_string":"Department of Microsystems Engineering (IMTEK) and Department of Mathematics, University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0625,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.93681625,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"6","issue":null,"first_page":"536","last_page":"541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.48069998621940613,"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.48069998621940613,"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.46320000290870667,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.023499999195337296,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/hessian-matrix","display_name":"Hessian matrix","score":0.8131999969482422},{"id":"https://openalex.org/keywords/linear-complementarity-problem","display_name":"Linear complementarity problem","score":0.5619000196456909},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5454999804496765},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.5339000225067139},{"id":"https://openalex.org/keywords/complementarity-theory","display_name":"Complementarity theory","score":0.5332000255584717},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5091999769210815},{"id":"https://openalex.org/keywords/mixed-complementarity-problem","display_name":"Mixed complementarity problem","score":0.5033000111579895},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4494999945163727},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4410000145435333},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4275999963283539}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.8131999969482422},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7202000021934509},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6082000136375427},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.5619000196456909},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5454999804496765},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.5339000225067139},{"id":"https://openalex.org/C85404239","wikidata":"https://www.wikidata.org/wiki/Q5156417","display_name":"Complementarity theory","level":3,"score":0.5332000255584717},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5091999769210815},{"id":"https://openalex.org/C77196050","wikidata":"https://www.wikidata.org/wiki/Q6883962","display_name":"Mixed complementarity problem","level":3,"score":0.5033000111579895},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4410000145435333},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4275999963283539},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.40779998898506165},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.4016999900341034},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.39250001311302185},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.3912000060081482},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3889000117778778},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.38589999079704285},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.38339999318122864},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.37040001153945923},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.36399999260902405},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.362199991941452},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.3416999876499176},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3230000138282776},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.31790000200271606},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.3172999918460846},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C73729460","wikidata":"https://www.wikidata.org/wiki/Q17023339","display_name":"Hessian equation","level":4,"score":0.3149000108242035},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3086000084877014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30250000953674316},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2953000068664551},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.28700000047683716},{"id":"https://openalex.org/C2778646529","wikidata":"https://www.wikidata.org/wiki/Q16948724","display_name":"Nonlinear complementarity problem","level":4,"score":0.2809000015258789},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27090001106262207},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.26579999923706055},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.26420000195503235}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lcsys.2021.3083467","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcsys.2021.3083467","pdf_url":null,"source":{"id":"https://openalex.org/S4306422535","display_name":"IEEE Control Systems Letters","issn_l":"2475-1456","issn":["2475-1456"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Control Systems Letters","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2103.05965","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2103.05965","pdf_url":"https://arxiv.org/pdf/2103.05965","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2103.05965","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2103.05965","pdf_url":"https://arxiv.org/pdf/2103.05965","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W49930306","https://openalex.org/W104144503","https://openalex.org/W1971374211","https://openalex.org/W1974907817","https://openalex.org/W1983864916","https://openalex.org/W2013439434","https://openalex.org/W2015957593","https://openalex.org/W2023446959","https://openalex.org/W2033624514","https://openalex.org/W2034039293","https://openalex.org/W2037678919","https://openalex.org/W2039566400","https://openalex.org/W2051515327","https://openalex.org/W2074352998","https://openalex.org/W2077161157","https://openalex.org/W2112838397","https://openalex.org/W2123871098","https://openalex.org/W2128234186","https://openalex.org/W2133314983","https://openalex.org/W2139624848","https://openalex.org/W2769646558","https://openalex.org/W2842089854","https://openalex.org/W2903503922","https://openalex.org/W2950695410","https://openalex.org/W3046286341","https://openalex.org/W3107465411","https://openalex.org/W4232062228"],"related_works":[],"abstract_inverted_index":{"Mathematical":[0],"programs":[1,31],"with":[2,32,80],"complementarity":[3,34],"constraints":[4],"are":[5,117],"notoriously":[6],"difficult":[7],"to":[8,11,39],"solve":[9],"due":[10],"their":[12],"nonconvexity":[13],"and":[14,48,101,113],"lack":[15],"of":[16,29,103],"constraint":[17],"qualifications":[18],"in":[19,92,119],"every":[20],"feasible":[21],"point.":[22],"This":[23,76],"letter":[24],"focuses":[25],"on":[26,51],"the":[27,52,58,94],"subclass":[28],"quadratic":[30,65],"linear":[33],"constraints.":[35],"A":[36],"novel":[37],"approach":[38],"solving":[40],"a":[41,49,69,81,87,120],"penalty":[42,53,61],"reformulation":[43],"using":[44],"sequential":[45],"convex":[46,64],"programming":[47],"homotopy":[50],"parameter":[54],"is":[55,90,98,105],"introduced.":[56],"Linearizing":[57],"necessarily":[59],"nonconvex":[60],"function":[62,97],"yields":[63],"subproblems,":[66],"which":[67,93],"have":[68],"constant":[70],"Hessian":[71],"matrix":[72,84],"throughout":[73],"all":[74],"iterates.":[75],"allows":[77],"solution":[78],"computation":[79],"single":[82],"KKT":[83],"factorization.":[85],"Furthermore,":[86],"globalization":[88],"scheme":[89],"introduced":[91],"underlying":[95],"merit":[96],"minimized":[99],"analytically,":[100],"guarantee":[102],"descent":[104],"provided":[106],"at":[107],"each":[108],"iterate.":[109],"The":[110],"algorithmic":[111],"features":[112],"possible":[114],"computational":[115],"speedups":[116],"illustrated":[118],"numerical":[121],"experiment.":[122]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2021-03-15T00:00:00"}