Certification aspects of the fast gradient method for solving the dual of parametric convex programs

Mathematical Methods of Operations Research

Volumn 77, Issue 3, 2013, Pages 305-321

  Richter, Stefan ^a   Jones, Colin Neil ^b   Morari, Manfred ^a  

^a ETH ZURICH   (Switzerland)

^b EPFL   (Switzerland)

Author keywords

Certification; Fast gradient method; Lagrange relaxation

Indexed keywords

CERTIFICATION; CONVEX PROGRAMS; EMBEDDED OPTIMIZATIONS; EUCLIDEAN DISTANCE; FAST GRADIENT METHODS; ITERATION BOUND; LAGRANGE RELAXATION; PRACTICAL IMPORTANCE;

LAGRANGE MULTIPLIERS; MODEL PREDICTIVE CONTROL; OPERATIONS RESEARCH; OPTIMIZATION; PREDICTIVE CONTROL SYSTEMS;

GRADIENT METHODS;

EID: 84880044257     PISSN: 14322994     EISSN: 14325217     Source Type: Journal    
DOI: 10.1007/s00186-012-0420-7     Document Type: Article

References (29)

1. Bank B, Guddat J, Klatte D, Kummer B, Tammer K (1982) Non-linear parametric optimization. Akademie-Verlag, Berlin
2. Bertsekas DP (1999) Nonlinear programming, 2nd edn. Athena Scientific, Massachusetts
3. Bertsekas DP (2009) Convex Optimization theory, 1st edn. Athena Scientific, Massachusetts
4. Blackmore L, Açikmese B, Scharf D (2010) Minimum-landing-error powered-descent guidance for mars landing using convex optimization. J Guid Control Dyn 33(4):1161-1171
5. Bleris L, Kothare M (2005) Real-time implementation of model predictive control. In: American control conference, vol 6, pp 4166-4171
6. Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University Press, Cambridge
7. 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
8. 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-2671
9. 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
10. Devolder O, Glineur F, Nesterov Y (2012) Double smoothing technique for large-scale linearly constrained convex optimization. SIAM J Optim 22(2):702-727
11. 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
12. Fuchs A, Mariéthoz S, Larsson M, Morari M (2011) Grid stabilization through VSC-HVDC using wide area measurements. In: IEEE powertech. Power System Technology, Norway
13. Gauvin J (1977) A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming. Math Program 12:136-138
14. Golšteçn EG (1972) Theory of convex programming, vol 36. American Mathematical Society, Providence
15. 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
16. Lemaréchal 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-156
17. McGovern LK (2000) Computational analysis of real-time convex optimization for control systems. Thesis, Massachusetts Institute of Technology
18. Nedić A, Ozdaglar A (2009) Approximate primal solutions and rate analysis for dual subgradient methods. SIAM J Optim 19(4):1757-1780
19. 2. Soviet Math Dokl 27(2):372-376
20. Nesterov Y (2004a) Introductory lectures on convex optimization. Springer, Berlin
21. Nesterov Y (2004b) Smooth minimization of non-smooth functions. Math Program 103(1):127-152
22. 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
23. Polyak BT (1987) Introduction to optimization. Optimization Software
24. Rawlings JB, Mayne DQ (2009) Model predictive control theory and design. Nob Hill Pub, Madison
25. 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
26. 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-1403
27. Rockafellar RT (1997) Convex analysis. Princeton University Press, Princeton
28. Schmidt M, Roux NL, Bach F (2011) Convergence rates of inexact proximal-gradient methods for convex, optimization. arXiv:11092415
29. Tseng P (2008) On accelerated proximal gradient methods for convex-concave optimization. SIAM J Optim (submitted)