{"id":"https://openalex.org/W7104675280","doi":"https://doi.org/10.1109/tac.2025.3631575","title":"EIQP: Execution-Time-Certified and Infeasibility-Detecting QP Solver","display_name":"EIQP: Execution-Time-Certified and Infeasibility-Detecting QP Solver","publication_year":2025,"publication_date":"2025-11-11","ids":{"openalex":"https://openalex.org/W7104675280","doi":"https://doi.org/10.1109/tac.2025.3631575"},"language":null,"primary_location":{"id":"doi:10.1109/tac.2025.3631575","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2025.3631575","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"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 Transactions on Automatic Control","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":null,"display_name":"Liang Wu","orcid":"https://orcid.org/0000-0002-5452-3080"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Liang Wu","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-5452-3080","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Wei Xiao","orcid":"https://orcid.org/0000-0001-9622-6415"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wei Xiao","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9622-6415","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":null,"display_name":"Richard D. Braatz","orcid":"https://orcid.org/0000-0003-4304-3484"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard D. Braatz","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0003-4304-3484","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.5558,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.86138414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"71","issue":"5","first_page":"2934","last_page":"2949"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9218000173568726,"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"}},"topics":[{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9218000173568726,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.03290000185370445,"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/T10046","display_name":"Stability and Control of Uncertain Systems","score":0.00800000037997961,"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/solver","display_name":"Solver","score":0.5435000061988831},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5300999879837036},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4738999903202057},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.46480000019073486},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42080000042915344},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.41780000925064087},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.40689998865127563},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3978999853134155},{"id":"https://openalex.org/keywords/model-predictive-control","display_name":"Model predictive control","score":0.3874000012874603},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.3862000107765198}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5917999744415283},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5435000061988831},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5300999879837036},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4738999903202057},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.46480000019073486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4390999972820282},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4291999936103821},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42080000042915344},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.41780000925064087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4088999927043915},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3978999853134155},{"id":"https://openalex.org/C172205157","wikidata":"https://www.wikidata.org/wiki/Q1782962","display_name":"Model predictive control","level":3,"score":0.3874000012874603},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3862000107765198},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.38359999656677246},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.3822000026702881},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3741999864578247},{"id":"https://openalex.org/C2779982483","wikidata":"https://www.wikidata.org/wiki/Q6094420","display_name":"Iterative refinement","level":2,"score":0.3734999895095825},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.3587999939918518},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.34929999709129333},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34459999203681946},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.33309999108314514},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.32260000705718994},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.3140000104904175},{"id":"https://openalex.org/C14646407","wikidata":"https://www.wikidata.org/wiki/Q1430750","display_name":"Bellman equation","level":2,"score":0.30160000920295715},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2964000105857849},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2957000136375427},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.2879999876022339},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.2831999957561493},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.27950000762939453},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C31531917","wikidata":"https://www.wikidata.org/wiki/Q915157","display_name":"Robust control","level":3,"score":0.2653000056743622},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.26170000433921814},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2025.3631575","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2025.3631575","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"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 Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2221990718","display_name":null,"funder_award_id":"75F40122C00200","funder_id":"https://openalex.org/F4320332163","funder_display_name":"U.S. Food and Drug Administration"}],"funders":[{"id":"https://openalex.org/F4320332163","display_name":"U.S. Food and Drug Administration","ror":"https://ror.org/034xvzb47"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Solving":[0],"real-time":[1,25],"quadratic":[2],"programming":[3],"(QP)":[4],"is":[5,53,106,176],"a":[6,36,39,54,81,182],"ubiquitous":[7],"task":[8],"in":[9,14],"control":[10,17,19],"engineering,":[11],"such":[12,24],"as":[13],"model":[15],"predictive":[16],"and":[18,65,123,144,154,191,198,201],"barrier":[20],"function-based":[21],"QP.":[22],"In":[23],"scenarios,":[26],"certifying":[27],"that":[28,98],"the":[29,49,89,129,150,155,165,187],"employed":[30],"QP":[31,46,61],"algorithm":[32,87,175],"can":[33],"either":[34],"return":[35],"solution":[37],"within":[38],"predefined":[40,50,156],"level":[41],"of":[42,152,168],"optimality":[43,157],"or":[44],"detect":[45],"infeasibility":[47,72],"before":[48],"sampling":[51],"time":[52,167],"pressing":[55],"requirement.":[56],"This":[57],"article":[58,79],"considers":[59],"convex":[60,171],"(including":[62],"linear":[63],"programming)":[64],"adopts":[66],"its":[67,192],"homogeneous":[68,76],"formulation":[69],"to":[70,108,121,163,178],"achieve":[71],"detection.":[73],"Exploiting":[74],"this":[75,78],"formulation,":[77],"proposes":[80],"novel":[82],"infeasible":[83],"interior-point":[84],"method":[85],"(IPM)":[86],"with":[88,128],"best":[90],"theoretical":[91],"<inline-formula":[92,131,140,145],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[93,111,119,125,132,141,146],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[94,133,142,147],"notation=\"LaTeX\">$O(\\sqrt{n})$</tex-math></inline-formula>":[95],"iteration":[96,104],"complexity":[97,105],"feasible":[99],"IPM":[100],"algorithms":[101],"enjoy.":[102],"The":[103,173],"proved":[107],"be":[109],"<italic":[110,118,124],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">exact</i>":[112],"(rather":[113],"than":[114],"an":[115],"upper":[116],"bound),":[117],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">simple":[120],"calculate</i>,":[122],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">data":[126],"independent</i>,":[127],"value":[130],"notation=\"LaTeX\">$\\left\\lceil":[134],"\\frac{\\log":[135],"(\\frac{n+1}{\\epsilon":[136],"})}{-\\log":[137],"(1-\\frac{0.414213}{\\sqrt{n+1}})}\\right\\rceil$</tex-math></inline-formula>":[138],"(where":[139],"notation=\"LaTeX\">$n$</tex-math></inline-formula>":[143],"notation=\"LaTeX\">$\\epsilon$</tex-math></inline-formula>":[148],"denote":[149],"number":[151],"constraints":[153],"level,":[158],"respectively),":[159],"making":[160],"it":[161],"appealing":[162],"certify":[164],"execution":[166],"online":[169],"time-varying":[170],"QPs.":[172],"proposed":[174],"simple":[177],"implement":[179],"without":[180],"requiring":[181],"line":[183],"search":[184],"procedure":[185],"(uses":[186],"full":[188],"Newton":[189],"step),":[190],"C-code":[193],"implementation":[194],"(offering":[195],"MATLAB,":[196],"Julia,":[197],"Python":[199],"interfaces)":[200],"numerical":[202],"examples":[203],"are":[204],"provided.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-28T06:04:28.489925","created_date":"2025-11-11T00:00:00"}