A splitting method for optimal control

IEEE Transactions on Control Systems Technology

Volumn 21, Issue 6, 2013, Pages 2432-2442

  O'Donoghue, Brendan ^a   Stathopoulos, Giorgos ^b   Boyd, Stephen ^a  

^a Stanford University   (United States)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Alternating directions method of multipliers (ADMM); convex optimization; embedded control; fixed point algorithms for control; model predictive control (MPC); operator splitting; optimal control

Indexed keywords

ALTERNATING DIRECTIONS METHOD OF MULTIPLIERS; EMBEDDED CONTROL; FIXED-POINT ALGORITHMS; OPERATOR-SPLITTING; OPTIMAL CONTROLS;

ALGORITHMS; CONTROL; CONVEX OPTIMIZATION; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); MODEL PREDICTIVE CONTROL; OPTIMAL CONTROL SYSTEMS;

PREDICTIVE CONTROL SYSTEMS;

EID: 84886584535     PISSN: 10636536     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCST.2012.2231960     Document Type: Article

References (75)

1. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
2. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, MA: Cambridge Univ. Press, 2004.
3. S. Wright, "Interior-point method for optimal control of discrete-time systems," J. Optim. Theory Appl., vol. 77, no. 1, pp. 161-187, Apr. 1993.
4. J. Betts, Practical Methods for Optimal Control and Estimation Using Nonlinear Programming. Philadelphia, PA: SIAM, 2010.
5. Y. Wang and S. Boyd, "Fast model predictive control using online optimization," IEEE Trans. Control Syst. Technol., vol. 18, no. 2, pp. 267-278, Mar. 2010.
6. C. Rao, S. Wright, and J. Rawlings, "Application of interior point methods to model predictive control," J. Optim. Theory Appl., vol. 99, no. 3, pp. 723-757, Nov. 2004.
7. A. Hansson, "A primal-dual interior-point method for robust optimal control of linear discrete-time systems," IEEE Trans. Autom. Control, vol. 45, no. 9, pp. 1639-1655, Sep. 2000.
8. A. Hansson and S. Boyd, "Robust optimal control of linear discretetime systems using primal-dual interior-point methods," in Proc. Amer. Control Conf., vol. 1. 1998, pp. 183-187.
9. M. Åkerblad and A. Hansson, "Efficient solution of second order cone program for model predictive control," Int. J. Control, vol. 77, no. 1, pp. 55-77, Jan. 2004.
10. J. Mattingley and S. Boyd, "CVXGEN: A code generator for embedded convex optimization," Optim. Eng., vol. 13, no. 1, pp. 1-27, 2012.
11. B. Houska, H. Ferreau, and M. Diehl, "ACADO toolkit-an open-source framework for automatic control and dynamic Opt." Optim. Control Appl. Methods, vol. 32, no. 3, pp. 298-312, Jun. 2011.
12. A. Domahidi, A. Zgraggen, M. Zeilinger, M. Morari, and C. Jones, "Efficient interior point methods for multistage problems arising in receding horizon control," in Proc. 51st IEEE Conf. Decision Control, Dec. 2012, pp. 1-7.
13. T. Ohtsuka and A. Kodama, "Automatic code generation system for nonlinear receding horizon control," IEEE Trans. Soc. Instrum. Control Eng., vol. 38, no. 7, pp. 617-623, Jul. 2002.
14. T. Ohtsuka, "A continuation/GMRES method for fast computation of nonlinear receding horizon control," Automatica, vol. 40, no. 4, pp. 563-574, Apr. 2004.
15. J. Mattingley, Y. Wang, and S. Boyd, "Receding horizon control: Automatic generation of high-speed solvers," IEEE Control Syst. Mag., vol. 31, no. 3, pp. 52-65, Jun. 2011.
16. A. Bemporad, M. Morari, V. Dua, and E. Pistikopoulos, "The explicit linear quadratic regulator for constrained systems," Automatica, vol. 38, no. 1, pp. 3-20, Jan. 2002. (Pubitemid 33034535)
17. P. Tøndel, T. Johansen, and A. Bemporad, "An algorithm for multiparametric quadratic programming and explicit MPC solutions," in Proc. IEEE Conf. Decision Control, Dec. 2001, pp. 1199-1204. (Pubitemid 34139092)
18. G. Pannocchia, J. Rawlings, and S. Wright, "Fast, large-scale model predictive control by partial enumeration," Automatica, vol. 43, no. 5, pp. 852-860, May 2006.
19. M. Best, "An algorithm for the solution of the parametric quadratic programming problem," in Appl. Math. Parallel Computation. Physica-Verlag: Heidelberg, 1996, pp. 57-76.
20. P. Gill, N. Gould, W. Murray, M. Saunders, and M. Wright, "A weighted Gram-Schmidt method for convex quadratic programming," Math. Programm., vol. 30, pp. 176-195, Jan. 1984. (Pubitemid 15423247)
21. P. Gill, W. Murray, M. Saunders, and M. Wright, "Procedures for optimization problems with a mixture of bounds and general linear constraints," ACM Trans. Math. Softw., vol. 10, no. 3, pp. 282-298, Sep. 1984. (Pubitemid 15421456)
22. D. Goldfarb and A. Idnani, "A numerically stable dual method for solving strictly convex quadratic programs," Math. Programm., vol. 27, no. 1, pp. 1-33, 1983. (Pubitemid 14453989)
23. R. Bartlett and L. Biegler, "QPSchur: A dual, active set, Schur complement method for large-scale and structured convex quadratic programming algorithm," Opt. Eng., vol. 7, no. 1, pp. 5-32, Mar. 2006.
24. H. Ferreau, "An online active set strategy for fast solution of parametric quadratic programs with applications to predictive engine control," M.S. thesis, Univ. Heidelberg, Heidelberg, Germany, 2006.
25. H. Ferreau, H. Bock, and M. Diehl, "An online active set strategy to overcome the limitations of explicit MPC," Int. J. Robust Nonlinear Control, vol. 18, no. 8, pp. 816-830, 2008. (Pubitemid 351743519)
26. Y. Nesterov, "A method of solving a convex programming problem with convergence rate O(1/k2)," Soviet Math. Doklady, vol. 27, no. 2, pp. 372-376, 1983.
27. Y. Nesterov. (2007) "Gradient methods for minimizing composite objective function," [Online]. Available: http://www.ecore.be/DPs/dp 1191313936.pdf
28. S. Richter, C. Jones, and M. Morari, "Real-time input-constrained MPC using fast gradient methods," in Proc. 48th IEEE Conf. Decision Control, Dec. 2009, pp. 7387-7393.
29. S. Richter, S. Marièthoz, and M. Morari, "High-speed online MPC based on a fast gradient method applied to power converter control," in Proc. Amer. Control Conf., Jul. 2010, pp. 4737-4743.
30. M. Kögel and R. Findeisen, "A fast gradient method for embedded linear predictive control," in Proc. 18th IFAC World Conf., Aug. 2011, pp. 1362-1367.
31. M. Kögel and R. Findeisen, "Fast predictive control of linear, timeinvariant systems using an algorithm based on the fast gradient method and augmented lagrange multipliers," in Proc. IEEE Int. Conf. Control Appl., Sep. 2011, pp. 780-785.
32. M. Kögel and R. Findeisen, "Fast predictive control of linear systems combining Nesterov's gradient method and the method of multipliers," in Proc. 50th IEEE Conf. Decision Control, Dec. 2011, pp. 501-506.
33. K. Ling, B. Wu, and J. Maciejowski, "Embedded model predictive control (MPC) using a FPGA," in Proc. 17th IFAC World Congr., Jul. 2008, pp. 15250-15255.
34. M. Lau, S. Yue, K. Ling, and J. Maciejowski, "A comparison of interior point and active set methods for FPGA implementation of model predictive control," in Proc. ECC, Aug. 2009, pp. 156-161.
35. J. Jerez, G. Constantinides, E. Kerrigan, and K. Ling, "Parallel MPC for real-time FPGA-based implementation," in Proc. 18th IFAC World Congr., Aug. 2011, pp. 1338-1343.
36. S. Longo, E. Kerrigan, K. Ling, and G. Constantinides, "Parallel move blocking model predictive control," in Proc. IEEE Decision Control Eur. Control Conf., Dec. 2011, pp. 1239-1244.
37. S. Richter, C. Jones, and M. Morari, "Computational complexity certification for real-time MPC with input constraints based on the fast gradient method," IEEE Trans. Autom. Control, vol. 57, no. 6, pp. 1391-1403, Jun. 2012.
38. J. Jerez, G. Constantinides, and E. Kerrigan, "To-wards a fixed point QP solver for predictive control," in Proc. IEEE 51st Conf. Decision Control, Dec. 2012, pp. 1-6.
39. A. Wills, G. Knagge, and B. Ninness, "Fast linear model predictive control via custom integrated circuit architecture," IEEE Trans. Control Syst. Technol., vol. 20, no. 1, pp. 59-71, Jan. 2012.
40. J. Jerez, G. Constantinides, and E. Kerrigan, "An FPGA implementation of a sparse quadratic programming solver for constrained predictive control," in Proc. ACM Symp. Field Program. Gate Arrays, 2011, pp. 209-218.
41. P. Vouzis, L. Bleris, M. Arnold, and M. Kothare, "A system-on-a-chip implementation for embedded real-time model predictive control," IEEE Trans. Control Syst. Technol., vol. 17, no. 5, pp. 1006-1017, Sep. 2009.
42. A. Wills, G. Knagge, and B. Ninness, "Fast linear model predictive control via custom integrated circuit architecture," IEEE Trans. Control Syst. Technol., vol. 20, no. 1, pp. 59-71, Jan. 2012.
43. E. Hartley, J. Jerez, A. Suardi, J. Maciejowski, E. Kerrigan, and G. Constantinides, "Predictive control of a Boeing 747 aircraft using an FPGA," in Proc. IFAC NMPC Conf., Aug. 2012, pp. 1-6.
44. R. Glowinski and A. Marrocco, "Sur l'approximation, par elements finis d'ordre un, et la resolution, par penalisation-dualité, d'une classe de problems de Dirichlet non lineares," in Proc. Revue Française d'Automatique, Informatique, et Recherche Opérationelle, vol. 9. 1975, pp. 41-76.
45. D. Gabay and B. Mercier, "A dual algorithm for the solution of nonlinear variational problems via finite element approximations," Comput. Math. Appl., vol. 2, no. 1, pp. 17-40, 1976.
46. D. Gabay, "Applications of the method of multipliers to variational inequalities," in Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems. M. Fortin and R. Glowinski, Eds. Amsterdam, The Netherlands: North-Holland, 1983.
47. J. Eckstein and D. Bertsekas, "On the Douglasâ-Rachford splitting method and the proximal point algorithm for maximal monotone operators," Math. Programm., vol. 55, no. 1, pp. 293-318, 1992.
48. B. He and X. Yuan, On Non-Ergodic Convergence Rate of Douglas-Rachford Alternating Direction Method of Multipliers., Jan. 2012, pp. 1-9.
49. B. He and X. Yuan, "On the O(1/n) convergence rate of the Douglas-Rachford alternating direction method," SIAM J. Numer. Anal., vol. 50, no. 2, pp. 700-709, Mar. 2012.
50. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, "Distributed optimization and statistical learning via the alternating direction method of multipliers," Found. Trends Mach. Learn., vol. 3, no. 1, pp. 1-122, 2011.
51. B. Wahlberg, S. Boyd, M. Annergren, and Y. Wang, "An ADMM algorithm for a class of total variation regularized estimation problems," in Proc. 16th IFAC Symp. Syst. Identificat., Jul. 2012, pp. 1-6.
52. M. Annergren, A. Hansson, and B. Wahlberg, "An ADMM algorithm for solving-1 regularized MPC," in Proc. IEEE 51st Conf. Decision Control, Mar. 2012, pp. 1-8.
53. P. Combettes, "The convex feasibility problem in image recovery," in Proc. Adv. Imag. Electron Phys. Conf., vol. 95. 1996, pp. 155-270.
54. F. Lin, M. Fardad, and M. Jovanovic, "Design of optimal sparse feedback gains via the alternating direction method of multipliers," in Proc. Amer. Control Conf., Jun. 2012, pp. 4765-4770.
55. T. Goldstein, B. O'Donoghue, and S. Setzer. (2012). Fast Alternating Direction Optimization Methods [Online]. Available FTP: ftp://ftp.math.ucla.edu/ pub/camreport/cam12-35.pdf
56. D. Goldfarb, S. Ma, and K. Scheinberg, "Fast alternating linearization methods for minimizing the sum of two convex functions," Cornell Univ. Library, Ithaca, NY, Tech. report, 10-02, 2010.
57. D. Goldfarb and S. Ma, Fast Multiple Splitting Algorithms for Convex Optimization 2011, pp. 1-21
58. P. Combettes and J. Pesquet, "Proximal splitting methods in signal processing," in Fixed-Point Algorithms for Inverse Problems in Science and Engineering, H. Bauschke, R. Burachik, V. E. P. Combettes, D. Luke, and H. Wolkowicz, Eds. New York: SIAM, 2011, pp. 185-212.
59. L. Vandenberghe. (2012) "Lecture on proximal gradient method," [Online] Available: http://www.ee.ucla.edu/vandenbe/shortcourses/mlss12- convexopt.pdf
60. J. Eckstein, "Parallel alternating direction multiplier decomposition of convex programs," J. Opt. Theory Appl., vol. 80, no. 1, pp. 39-62, 1994.
61. J. Eckstein and M. Ferris, "Operator-splitting methods for monotone affine variational inequalities, with a parallel application to optimal control," INFORMS J. Comput., vol. 10, no. 2, pp. 218-235, 1998. (Pubitemid 128669129)
62. J. Bunch and B. Parlett, "Direct methods for solving symmetric indefinite systems of linear equations," SIAM J. Numer. Anal., vol. 8, no. 4, pp. 639-655, Dec. 1971.
63. J. Demmel, Applied Numerical Linear Algebra. Philadelphia, PA: SIAM, 1997.
64. N. J. Higham, Accuracy and Stability of Numerical Algorithms. Philadelphia, PA: SIAM, 2002.
65. L. Trefethen and D. Bau, Numerical Linear Algebra. Philadelphia, PA: SIAM, 1997.
66. R. Vanderbei, "Symmetric quasi-definite matrices," SIAM J. Opti., vol. 5, no. 1, pp. 100-113, 1995.
67. M. A. Saunders, "Cholesky-based methods for sparse least squares: The benefits of regularization," in Linear and Nonlinear Conjugate Gradient-Related Methods, L. Adams and J. L. Nazareth, Eds. Philadelphia: SIAM, 1996, pp. 92-100.
68. I. Duff, A. Erisman, and J. Reid, Direct Methods for Sparse Matrices. London, U.K.: Oxford Univ. Press, 1989.
69. M. Grant, S. Boyd, and Y. Ye. (2006) "CVX: Matlab software for disciplined convex programming," [Online]. Available: https://cvxr.com/cvx/
70. M. Grant and S. Boyd, "Graph implementations for nonsmooth convex programs," in Recent Advances in Learning and Control (ser. Lecture Notes in Control and Information Sciences), V. Blondel, S. Boyd, and H. Kimura, Eds. New York: Springer-Verlag, 2008, pp. 95-110.
71. K. Toh, M. Todd, and R. Tütüncü, "SDPT3: A Matlab software package for semidefinite programming," Opt. Meth. Softw., vol. 11, no. 12, pp. 545-581, 1999.
72. T. Davis, "Algorithm 849: A concise sparse Cholesky factorization package," ACM Trans. Math. Softw., vol. 31, no. 4, pp. 587-591, Dec. 2005.
73. P. Amestoy, T. Davis, and I. Duff, "Algorithm 837: AMD, an approximate minimum degree ordering algorithm," ACM Trans. Math. Softw., vol. 30, no. 3, pp. 381-388, 2004.
74. T. Davis, Direct Methods for Sparse Linear Systems (ser. SIAM Fundamentals of Algorithms). Philadelphia, PA: SIAM, 2006.
75. S. Boyd, M. Mueller, B. O'Donoghue, and Y. Wang. (2012) "Performance bounds and suboptimal policies for multi-period investment," [Online]. Available: http://www.stanford.edu/?boyd/papers/port-opt bound.html