{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T16:57:46Z","timestamp":1782406666482,"version":"3.54.5"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000038","name":"U.S. Food and Drug Administration","doi-asserted-by":"publisher","award":["BAA-22-00123"],"award-info":[{"award-number":["BAA-22-00123"]}],"id":[{"id":"10.13039\/100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000038","name":"U.S. Food and Drug Administration","doi-asserted-by":"publisher","award":["75F40122C00200"],"award-info":[{"award-number":["75F40122C00200"]}],"id":[{"id":"10.13039\/100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/tac.2024.3463529","type":"journal-article","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T18:06:50Z","timestamp":1726682810000},"page":"1366-1373","source":"Crossref","is-referenced-by-count":14,"title":["A Direct Optimization Algorithm for Input-Constrained MPC"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5452-3080","authenticated-orcid":false,"given":"Liang","family":"Wu","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4304-3484","authenticated-orcid":false,"given":"Richard D.","family":"Braatz","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2176389"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6427093"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2275667"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2696742"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029370"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.10.050"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3038035"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3090749"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2020.109429"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2020.12.1188"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2009.2017934"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-014-0071-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-020-00179-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2023.3241238"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2023.10.235"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/00207179.2016.1222553"},{"issue":"3","key":"ref17","first-page":"159","article-title":"How good is the simplex algorithm","volume":"3","author":"Klee","year":"1972","journal-title":"Inequalities"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021711402723"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/00207179.2017.1316017"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/0802028"},{"key":"ref21","volume-title":"Numerical Optimization","author":"Nocedal","year":"2006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2008.05.006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718812"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701"},{"issue":"1","key":"ref26","first-page":"3","article-title":"A weighted-path-following method for linear optimization","volume":"47","author":"Darvay","year":"2002","journal-title":"Studia Universitatis Babes-Bolyai, Ser. Informatica"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1590\/S0101-82052006000100005"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/02331934.2023.2169047"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s13370-013-0193-z"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/9.557577"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2024.09.052"},{"key":"ref33","article-title":"An execution-time-certified Riccati-based IPM algorithm for RTI-based input-constrained NMPC","volume-title":"Proc. 63nd IEEE Conf. Decis. Control","author":"Wu","year":"2024"},{"key":"ref34","article-title":"A parallel vector-form $PLX.LDL^\\top$ decomposition for accelerating execution-time-certified $\\ell _{1}$-penalty soft-constrained MPC","author":"Wu","year":"2024"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9\/10857662\/10683964.pdf?arnumber=10683964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T05:37:44Z","timestamp":1738215464000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10683964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":34,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tac.2024.3463529","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}