{"id":"https://openalex.org/W2105071812","doi":"https://doi.org/10.1109/cdc.2007.4434608","title":"Relaxations applicable to mixed integer predictive control comparisons and efficient computations","display_name":"Relaxations applicable to mixed integer predictive control comparisons and efficient computations","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2105071812","doi":"https://doi.org/10.1109/cdc.2007.4434608","mag":"2105071812"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2007.4434608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2007.4434608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 46th IEEE Conference on Decision and Control","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56158","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028497393","display_name":"Daniel Axehill","orcid":"https://orcid.org/0000-0001-6957-2603"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Daniel Axehill","raw_affiliation_strings":["Division of Automatic Control, Link\u00f6ping universitet, Sweden","Linkopings Univ., Linkoping"],"affiliations":[{"raw_affiliation_string":"Division of Automatic Control, Link\u00f6ping universitet, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Linkopings Univ., Linkoping","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102968523","display_name":"Anders Hansson","orcid":"https://orcid.org/0000-0001-7282-8219"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Anders Hansson","raw_affiliation_strings":["Division of Automatic Control, Link\u00f6ping universitet, Sweden","Linkopings Univ., Linkoping"],"affiliations":[{"raw_affiliation_string":"Division of Automatic Control, Link\u00f6ping universitet, Sweden","institution_ids":["https://openalex.org/I102134673"]},{"raw_affiliation_string":"Linkopings Univ., Linkoping","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017990990","display_name":"Lieven Vandenberghe","orcid":"https://orcid.org/0000-0003-4153-2268"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lieven Vandenberghe","raw_affiliation_strings":["Department of Electrical Engineering, University of California, Los Angeles, Los Angeles, CA, USA","Department of Electrical Engineering, University of California, Los Angeles, 90095-1594, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of California, Los Angeles, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of California, Los Angeles, 90095-1594, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028497393"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":5.2671,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.95376456,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"312","issue":null,"first_page":"4103","last_page":"4109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.9995999932289124,"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.9995999932289124,"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.9975000023841858,"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/T11236","display_name":"Control Systems and Identification","score":0.9940999746322632,"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/relaxation","display_name":"Relaxation (psychology)","score":0.8108429908752441},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7312891483306885},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5820180773735046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5339744091033936},{"id":"https://openalex.org/keywords/model-predictive-control","display_name":"Model predictive control","score":0.5073439478874207},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.49947261810302734},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4867401123046875},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4783494174480438},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4647618532180786},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44358348846435547},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.44034117460250854},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4314606785774231},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43134886026382446},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.43027475476264954},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.4280456602573395},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3557814657688141},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3337211608886719},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32569313049316406},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.15783634781837463},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08671519160270691},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.060967206954956055}],"concepts":[{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.8108429908752441},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7312891483306885},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5820180773735046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5339744091033936},{"id":"https://openalex.org/C172205157","wikidata":"https://www.wikidata.org/wiki/Q1782962","display_name":"Model predictive control","level":3,"score":0.5073439478874207},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.49947261810302734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4867401123046875},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4783494174480438},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4647618532180786},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44358348846435547},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.44034117460250854},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4314606785774231},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43134886026382446},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.43027475476264954},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.4280456602573395},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3557814657688141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3337211608886719},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32569313049316406},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.15783634781837463},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08671519160270691},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.060967206954956055},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc.2007.4434608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2007.4434608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 46th IEEE Conference on Decision and Control","raw_type":"proceedings-article"},{"id":"pmh:oai:DiVA.org:liu-56158","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56158","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:liu-56158","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56158","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Report"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4300000071525574,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W123338590","https://openalex.org/W391578156","https://openalex.org/W572922989","https://openalex.org/W1592393005","https://openalex.org/W1967344706","https://openalex.org/W2026994988","https://openalex.org/W2080905757","https://openalex.org/W2093335754","https://openalex.org/W2098101867","https://openalex.org/W2128388880","https://openalex.org/W2134376819","https://openalex.org/W2182510773","https://openalex.org/W2336259629","https://openalex.org/W2536620281","https://openalex.org/W2610857016","https://openalex.org/W2917997019"],"related_works":["https://openalex.org/W2352839224","https://openalex.org/W2371590971","https://openalex.org/W1653317167","https://openalex.org/W2203098598","https://openalex.org/W2024017812","https://openalex.org/W2461836650","https://openalex.org/W2121045497","https://openalex.org/W4389749172","https://openalex.org/W2952690984","https://openalex.org/W2388495914"],"abstract_inverted_index":{"In":[0,23],"this":[1,125],"work,":[2],"different":[3],"relaxations":[4,39,60],"applicable":[5],"to":[6,142,180],"an":[7,75,168],"MPC":[8],"problem":[9,25],"with":[10,186],"a":[11,129,173],"mix":[12],"of":[13,47],"real":[14],"valued":[15,18],"and":[16,35,43,50,74,97,114,136],"binary":[17],"control":[19,36],"signals":[20],"are":[21,29,40,54,62],"compared.":[22],"the":[24,45,48,51,63,68,84,89,94,103,107,111,133,143,153,164,182,192],"description":[26],"considered,":[27],"there":[28],"linear":[30,188],"inequality":[31],"constraints":[32],"on":[33],"states":[34],"signals.":[37],"The":[38,59,80,119],"related":[41],"theoretically":[42],"both":[44],"tightness":[46],"bounds":[49],"computational":[52,189],"complexities":[53],"compared":[55,141],"in":[56,124,167,191],"numerical":[57],"experiments.":[58],"considered":[61],"quadratic":[64],"programming":[65,71],"(QP)":[66],"relaxation,":[67],"standard":[69,85,144],"semidefinite":[70],"(SDP)":[72],"relaxation":[73,87,105,122,135,157,185],"equality":[76,120,154,183],"constrained":[77,121,155,184],"SDP":[78,86,145,156],"relaxation.":[79,146],"result":[81],"is":[82,88,98,106,115,137,149],"that":[83,91,109],"one":[90,108],"usually":[92],"gives":[93,110,128],"best":[95],"bound":[96,113,131],"most":[99],"computationally":[100,117,139],"demanding,":[101],"while":[102],"QP":[104,134],"worst":[112],"least":[116],"demanding.":[118],"presented":[123],"paper":[126],"often":[127],"better":[130],"than":[132],"less":[138],"demanding":[140],"Furthermore,":[147],"it":[148,178],"also":[150],"shown":[151],"how":[152],"can":[158],"be":[159],"efficiently":[160],"computed":[161],"by":[162],"solving":[163],"Newton":[165],"system":[166],"Interior":[169],"Point":[170],"algorithm":[171],"using":[172],"Riccati":[174],"recursion.":[175],"This":[176],"makes":[177],"possible":[179],"compute":[181],"approximately":[187],"complexity":[190],"prediction":[193],"horizon.":[194]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}