An improved distributed dual newton-CG method for convex quadratic programming problems

Proceedings of the American Control Conference

Volumn , Issue , 2014, Pages 2324-2329

  Kozma, Attila ^a   Klintberg, Emil ^b   Gros, Sebastien ^b   Diehl, Moritz ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Hierarchical control; Large scale systems; Optimal control

Indexed keywords

ITERATIVE METHODS; LARGE SCALE SYSTEMS; LINEAR ALGEBRA; QUADRATIC PROGRAMMING;

CONSTRAINT RELAXATION; CONVEX QUADRATIC PROGRAMMING; DISTRIBUTED OPTIMIZATION; DUAL DECOMPOSITION; HIERARCHICAL CONTROL; NEWTON ITERATIONS; NUMERICAL EXPERIMENTS; OPTIMAL CONTROLS;

PROBLEM SOLVING;

EID: 84905715348     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2014.6859083     Document Type: Conference Paper

References (24)

1. M. Powell, "Algorithms for nonlinear constraints that use Lagrangian functions", Mathematical Programming, vol. 14, no. 3, pp. 224-248, 1978.
2. H. Bock and K. Plitt, "a multiple shooting algorithm for direct solution of optimal control problems", in Proceedings 9th IFAC World Congress Budapest. Pergamon Press, 1984, pp. 242-247.
3. C. Savorgnan, C. Romani, A. Kozma, and M. Diehl, "Multiple shooting for distributed systems with applications in hydro electricity production", Journal of Process Control, vol. 21, pp. 738-745, 2011.
4. E. Gertz and S. Wright, "Object-Oriented Software for Quadratic Programming", ACM Transactions on Mathematical Software, vol. 29, no. 1, pp. 58-81, 2003.
5. IBM Corp., IBM ILOG CPLEX V12.1, User's Manual for CPLEX, 2009.
6. C. Lemaréchal, "Lagrangian relaxation", in Computational Combinatorial Optimization, ser. Lecture Notes in Computer Science, M. Jünger and D. Naddef, Eds. Springer Berlin/Heidelberg, 2001, vol. 2241, pp. 112-156. [Online]. Available: http://dx.doi.org/10.1007/3-540-45586-84
7. R. W. Cottle, S. G. Duvall, and K. Zikan, "A lagrangean relaxation algorithm for the constrained matrix problem", Naval Research Logistics Quarterly, vol. 33, no. 1, pp. 55-76, 1986. [Online]. Available: http://dx.doi.org/10.1002/nav.3800330106
8. L. S. Lasdon, Optimization theory for Large Systems. Dover, 1970.
9. P. Tseng, "Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach", SIAM Journal on Control and Optimization, vol. 28, no. 1, pp. 214-242, 1990. [Online]. Available: http://epubs.siam.org/doi/abs/10.1137/0328011
10. P. Giselsson and A. Rantzer, "Distributed model predictive control with suboptimality and stability guarantees", in Decision and Control (CDC), 2010 49th IEEE Conference on, 2010, pp. 7272-7277.
11. S. Richter, M. Morari, and C. Jones, "Towards computational complexity certification for constrained MPC based on Lagrange Relaxation and the fast gradient method", in 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), 2011, pp. 5223-5229.
12. I. Necoara, V. Nedelcu, and I. Dumitrache, "Parallel and distributed optimization methods for estimation and control in networks", Journal of Process Control, vol. 21, no. 5, pp. 756-766, 2011, special Issue on Hierarchical and Distributed Model Predictive Control. [Online]. Available: http://www.sciencedirect.com/science/article/pii/S095915241000257X
13. P. Giselsson, M. D. Doan, T. Keviczky, B. D. Schutter, and A. Rantzer, "Accelerated gradient methods and dual decomposition in distributed model predictive control", Automatica, vol. 49, no. 3, pp. 829-833, 2013. [Online]. Available: http://www.sciencedirect.com/science/article/pii/ S0005109813000101
14. H. Ferreau, A. Kozma, and M. Diehl, "A parallel active-set strategy to solve sparse parametric quadratic programs arising in MPC", in Proceedings of the 4th IFAC Nonlinear Model Predictive Control Conference, Noordwijkerhout, The Netherlands, 2012.
15. J. V. Frasch, M. Vukov, H. Ferreau, and M. Diehl. (2013) A dual Newton strategy for the efficient solution of sparse quadratic programs arising in SQP-based nonlinear MPC. Optimization Online 3972. [Online]. Available: http://www.optimizationonline.org/DBHTML/2013/07/3972.html
16. A. Kozma, J. V. Frasch, and M. Diehl, "A Distributed Method for Convex Quadratic Programming Problems Arising in Optimal Control of Distributed Systems", in Proceedings of the 52nd Conference on Decision and Control (CDC), 2013.
17. W. Li and J. Swetits, "A new algorithm for solving strictly convex quadratic programs", SIAM Journal of Optimization, vol. 7, no. 3, pp. 595-619, 1997.
18. L. Qi and J. Sun, "A nonsmooth version of Newton's method", Mathematical Programming, vol. 58, pp. 353-367, 1993.
19. M. Gerdts and M. Kunkel, "A nonsmooth Newton's method for discretized optimal control problems with state and control constraints", Journal of Industrial and Management Optimization, vol. 4, pp. 247-270, 2008.
20. F. Clarke, Optimization and Nonsmooth Analysis, ser. Classics in Applied Mathematics. Society for Industrial and Applied Mathematics, 1990.
21. J. R. Shewchuk, "An introduction to the conjugate gradient method without the agonizing pain", Carnegie Mellon University, Pittsburgh, PA, USA, Tech. Rep., 1994.
22. D. Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: Numerical methods. Prentice Hall, 1989.
23. J. Lewis and R. van de Geijn, "Distributed memory matrix-vector multiplication and conjugate gradient algorithms", in Supercomputing'93. Proceedings, nov. 1993, pp. 484-492.
24. B. O'Donoghue and E. Candès, "Adaptive restart for accelerated gradient schemes", Foundations of Computational Mathematics, pp. 1-18, 2013.