{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:30:45Z","timestamp":1761489045828},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,12,8]],"date-time":"2012-12-08T00:00:00Z","timestamp":1354924800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00186-012-0420-7","type":"journal-article","created":{"date-parts":[[2012,12,7]],"date-time":"2012-12-07T02:23:46Z","timestamp":1354847026000},"page":"305-321","source":"Crossref","is-referenced-by-count":26,"title":["Certification aspects of the fast gradient method for solving the dual of parametric convex programs"],"prefix":"10.1007","volume":"77","author":[{"given":"Stefan","family":"Richter","sequence":"first","affiliation":[]},{"given":"Colin Neil","family":"Jones","sequence":"additional","affiliation":[]},{"given":"Manfred","family":"Morari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,12,8]]},"reference":[{"key":"420_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-6328-5","volume-title":"Non-linear parametric optimization","author":"B Bank","year":"1982","unstructured":"Bank B, Guddat J, Klatte D, Kummer B, Tammer K (1982) Non-linear parametric optimization. Akademie-Verlag, Berlin"},{"key":"420_CR2","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific, Massachusetts","edition":"2"},{"key":"420_CR3","unstructured":"Bertsekas DP (2009) Convex Optimization theory, 1st edn. Athena Scientific, Massachusetts"},{"issue":"4","key":"420_CR4","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.2514\/1.47202","volume":"33","author":"L Blackmore","year":"2010","unstructured":"Blackmore L, A\u00e7ikmese B, Scharf D (2010) Minimum-landing-error powered-descent guidance for mars landing using convex optimization. J Guid Control Dyn 33(4):1161\u20131171","journal-title":"J Guid Control Dyn"},{"key":"420_CR5","doi-asserted-by":"crossref","unstructured":"Bleris L, Kothare M (2005) Real-time implementation of model predictive control. In: American control conference, vol 6, pp 4166\u20134171","DOI":"10.1109\/ACC.2005.1470631"},{"key":"420_CR6","doi-asserted-by":"crossref","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511804441"},{"key":"420_CR7","doi-asserted-by":"crossref","unstructured":"Boyd S, Ghaoui LE, Feron E, Balakrishnan V (1994) Linear matrix inequalities in system & control theory. Soc Ind Appl Math, vol 15. SIAM studies in Applied Mathematics, Philadelphia, PA","DOI":"10.1137\/1.9781611970777"},{"issue":"10","key":"420_CR8","doi-asserted-by":"crossref","first-page":"2657","DOI":"10.1109\/TASL.2012.2210875","volume":"20","author":"B Defraene","year":"2012","unstructured":"Defraene B, van Waterschoot T, Ferreau HJ, Diehl M, Moonen M (2012) Real-time perception-based clipping of audio signals using convex optimization. IEEE Trans Audio Speech Lang Process 20(10):2657\u20132671","journal-title":"IEEE Trans Audio Speech Lang Process"},{"key":"420_CR9","unstructured":"Devolder O, Glineur F, Nesterov Y (2011) First-order methods of smooth convex optimization with inexact oracle. Math Program (submitted). Available at http:\/\/www.optimizationonline.org\/DBFILE\/2010\/12\/2865.pdf"},{"issue":"2","key":"420_CR10","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/110826102","volume":"22","author":"O Devolder","year":"2012","unstructured":"Devolder O, Glineur F, Nesterov Y (2012) Double smoothing technique for large-scale linearly constrained convex optimization. SIAM J Optim 22(2):702\u2013727","journal-title":"SIAM J Optim"},{"key":"420_CR11","doi-asserted-by":"crossref","unstructured":"Doan M, Keviczky T, De Schutter B (2011) A dual decomposition-based optimization method with guaranteed primal feasibility for hierarchical MPC problems. In: 18th IFAC world congress","DOI":"10.3182\/20110828-6-IT-1002.03058"},{"key":"420_CR12","doi-asserted-by":"crossref","unstructured":"Fuchs A, Mari\u00e9thoz S, Larsson M, Morari M (2011) Grid stabilization through VSC-HVDC using wide area measurements. In: IEEE powertech. Power System Technology, Norway","DOI":"10.1109\/PTC.2011.6019437"},{"key":"420_CR13","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/BF01593777","volume":"12","author":"J Gauvin","year":"1977","unstructured":"Gauvin J (1977) A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming. Math Program 12:136\u2013138","journal-title":"Math Program"},{"key":"420_CR14","volume-title":"Theory of convex programming","author":"EG Gol\u2019\u0161te\u01d0n","year":"1972","unstructured":"Gol\u2019\u0161te\u01d0n EG (1972) Theory of convex programming, vol 36. American Mathematical Society, Providence"},{"key":"420_CR15","unstructured":"Lan G, Monteiro RD (2009) Iteration-complexity of first-order augmented Lagrangian methods for convex programming. Math Program (submitted). Available at http:\/\/www.optimizationonline.org\/DB_HTML\/2009\/05\/2294.html"},{"key":"420_CR16","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal C (2001) Lagrangian relaxation. In: Junger M, Naddef D (eds) Computational combinatorial optimization. Lecture notes in computer science, vol 2241. Springer, Berlin, Heidelberg, pp 112\u2013156","DOI":"10.1007\/3-540-45586-8_4"},{"key":"420_CR17","unstructured":"McGovern LK (2000) Computational analysis of real-time convex optimization for control systems. Thesis, Massachusetts Institute of Technology"},{"issue":"4","key":"420_CR18","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1137\/070708111","volume":"19","author":"A Nedi\u0107","year":"2009","unstructured":"Nedi\u0107 A, Ozdaglar A (2009) Approximate primal solutions and rate analysis for dual subgradient methods. SIAM J Optim 19(4):1757\u20131780","journal-title":"SIAM J Optim"},{"issue":"2","key":"420_CR19","first-page":"372","volume":"27","author":"Y Nesterov","year":"1983","unstructured":"Nesterov Y (1983) A method for solving a convex programming problem with convergence rate $$1\/k^2$$ . Soviet Math Dokl 27(2):372\u2013376","journal-title":"Soviet Math Dokl"},{"key":"420_CR20","doi-asserted-by":"crossref","unstructured":"Nesterov Y (2004a) Introductory lectures on convex optimization. Springer, Berlin","DOI":"10.1007\/978-1-4419-8853-9"},{"issue":"1","key":"420_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2004","unstructured":"Nesterov Y (2004b) Smooth minimization of non-smooth functions. Math Program 103(1):127\u2013152","journal-title":"Math Program"},{"key":"420_CR22","doi-asserted-by":"crossref","unstructured":"Nesterov Y, Nemirovskii A (1994) Interior-point polynomial algorithms in convex programming. Soc Ind Appl Math, SIAM studies in Applied Mathematics, Philadelphia, PA, p 405","DOI":"10.1137\/1.9781611970791"},{"key":"420_CR23","unstructured":"Polyak BT (1987) Introduction to optimization. Optimization Software"},{"key":"420_CR24","unstructured":"Rawlings JB, Mayne DQ (2009) Model predictive control theory and design. Nob Hill Pub, Madison"},{"key":"420_CR25","doi-asserted-by":"crossref","unstructured":"Richter S, Morari M, Jones CN (2011) Towards computational complexity certification for constrained MPC based on Lagrange relaxation and the fast gradient method. In: Conference on decision and control (CDC), Orlando","DOI":"10.1109\/CDC.2011.6160931"},{"issue":"6","key":"420_CR26","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1109\/TAC.2011.2176389","volume":"57","author":"S Richter","year":"2012","unstructured":"Richter S, Jones CN, Morari M (2012) Computational complexity certification for real-time MPC with input constraints based on the fast gradient method. IEEE Trans Autom Control 57(6):1391\u20131403","journal-title":"IEEE Trans Autom Control"},{"key":"420_CR27","unstructured":"Rockafellar RT (1997) Convex analysis. Princeton University Press, Princeton"},{"key":"420_CR28","unstructured":"Schmidt M, Roux NL, Bach F (2011) Convergence rates of inexact proximal-gradient methods for convex, optimization. arXiv:11092415"},{"key":"420_CR29","unstructured":"Tseng P (2008) On accelerated proximal gradient methods for convex-concave optimization. SIAM J Optim (submitted)"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0420-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-012-0420-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-012-0420-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T16:09:42Z","timestamp":1562429382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-012-0420-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,8]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["420"],"URL":"https:\/\/doi.org\/10.1007\/s00186-012-0420-7","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,8]]}}}