Relaxations applicable to mixed integer predictive control - comparisons and efficient computations

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2007, Pages 4103-4109

  Axehill, Daniel ^a   Hansson, Anders ^a   Vandenberghe, Lieven ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; LINEAR MATRIX INEQUALITIES; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

CONTROL SIGNALS; MIXED INTEGER PREDICTIVE CONTROL; NEWTON SYSTEMS; STANDARD SEMIDEFINITE PROGRAMMING;

PREDICTIVE CONTROL SYSTEMS;

EID: 62749136187     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2007.4434608     Document Type: Conference Paper

References (14)

1. L. A. Wolsey, Integer Programming. John Wiley & Sons, Inc., 1998.
2. M. X. Goemans and D. P. Williamson, ".878-approximation algorithms for MAX CUT and MAX 2SAT," in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94, Montréal, Québec, Canada, May 1994, pp. 422-431.
3. W. K. Ma, T. N. Davidson, K. Wong, Z. Q. Luo, and P. Ching, "Quasi-maximum-likelihood multiuser detection using semi-definite relaxation," IEEE Trans. Signal Process., vol. 50, no. 4, pp. 912-922, 2002.
4. J. Dahl, B. H. Fleury, and L. Vandenberghe, "Approximate maximum-likelihood estimation using semidefinite programming," in IEEE International Conference on Acoustics, Speech, and Signal Processing 2003, vol. 6, Apr. 2003, pp. VI - 721-724.
5. D. Axehill, L. Vandenberghe, and A. Hansson, "On relaxations applicable to model predictive control for systems with binary control signals," Automatic Control, ISY, Tech. Rep. 2771, Jan. 2007. [Online]. Available: http://www.rt.isy.liu.se/publications/doc?id=1928
6. D. Axehill, "Applications of integer quadratic programming in control and communication," Licentiate's Thesis, Linköpings universitet, 2005. [Online]. Available: http://www.divaportal.org/liu/theses/ abstract.xsql?dbi d=5263
7. J. B. Lasserre, "Global optimization with polynomials and the problem of moments," SLAM J. Optimiz., vol. 11, no. 3, pp. 796 - 817, 2001.
8. H. Wolkowicz, R. Saigal, and L. Vandenberghe, Eds., Handbook of Semidefinite Programming - Theory, Algorithms and Applications. Kluwer, 2000.
9. L. Vandenberghe, S. Boyd, and M. Nouralishahi, "Robust linear programming and optimal control," Department of Electrical Engineering, University of California Los Angeles, Tech. Rep., 2002.
10. M. Åkerblad, "A second order cone programming algorithm for model predictive control," Licentiate's Thesis, Royal Institute of Technology, 2002.
11. L. Vandenberghe, V. R. Balakrishnan, R. Wallin, A. Hansson, and T. Roh, Interior-point algorithms for semidefinite programming problems derived from the KYP lemma, ser. Lecture notes in control and information sciences. Springer, Feb. 2005, vol. 312, pp. 195 - 238.
12. J. Löfberg, "Yalmip: A toolbox for modeling and optimization in MATLAB," in Proceedings of the CACSD Conference, Taipei, Taiwan, 2004. [Online]. Available: http://control.ee.ethz.ch/~joloef/yalmip.php
13. K. C. Toh, R. Tütüncü, and M. J. Todd, "On the implementation and usage of SDPT3 - a MATLAB software package for semidefinite-quadratic-linear programming, version 4.0," Department of Mathematics, National University of Singapore, Tech. Rep., Jul. 2006.
14. R. A. Horn and C. R. Johnson, Matrix analysis. Cambridge University Press, 1985.