{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:48:27Z","timestamp":1725680907497},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1109\/cdc.2012.6426313","type":"proceedings-article","created":{"date-parts":[[2013,2,8]],"date-time":"2013-02-08T17:05:08Z","timestamp":1360343108000},"page":"650-655","source":"Crossref","is-referenced-by-count":6,"title":["Iteration complexity of an inexact augmented Lagrangian method for constrained MPC"],"prefix":"10.1109","author":[{"given":"Valentin","family":"Nedelcu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.97"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160931"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2010.5531095"},{"key":"13","first-page":"283","article-title":"An efficient method for nonlinear constraints in minimization problems","author":"powell","year":"1969","journal-title":"Optimization"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cta:20000634"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"2","article-title":"First-order methods of smooth convex optimization with inexact oracle","author":"devolder","year":"2011","journal-title":"CORE Discussion Papers"},{"journal-title":"Nonlinear Programming","year":"1999","author":"bertsekas","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2007159"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/j.conengprac.2005.06.003"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1950413.1950454"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2011.08.020"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2007.06.008"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(99)00214-9"},{"key":"8","article-title":"Iteration-complexity of first-order augmented Lagrangian methods for convex programming","author":"lan","year":"2008","journal-title":"Technical Report School of Industrial and Systems Engineering"}],"event":{"name":"2012 IEEE 51st Annual Conference on Decision and Control (CDC)","start":{"date-parts":[[2012,12,10]]},"location":"Maui, HI, USA","end":{"date-parts":[[2012,12,13]]}},"container-title":["2012 IEEE 51st IEEE Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6416474\/6425800\/06426313.pdf?arnumber=6426313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T03:13:42Z","timestamp":1498014822000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6426313\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/cdc.2012.6426313","relation":{},"subject":[],"published":{"date-parts":[[2012,12]]}}}