Semidefinite programming relaxations and algebraic optimization in control

European Journal of Control

Volumn 9, Issue 2-3, 2003, Pages 307-321

  Parrilo, Pablo A ^a   Lall, Sanjay ^b  

^a ETH ZURICH   (Switzerland)

^b 496 Lomita Mall   (United States)

Author keywords

Control theory; Duality; Linear matrix inequalities; Semidefinite programming; Sum of squares

Indexed keywords

ALGEBRA; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; OPTIMIZATION; RELAXATION PROCESSES;

DUALITY; LINEAR MATRIX INEQUALITIES; SEMIDEFINITE PROGRAMMING; SUM OF SQUARES;

COMPUTER PROGRAMMING;

EID: 0842274717     PISSN: 09473580     EISSN: None     Source Type: Journal    
DOI: 10.3166/ejc.9.307-321     Document Type: Article

References (64)

1. Alizadeh F. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J Optim 1995; 5(1): 13-51
2. Alizadeh F, Goldfarb D. Second order cone programming. Technical Report 51-2001, RUTCOR, Rutgers University, 2001
3. Alkire B, Vandenberghe L. Convex optimization problems involving finite autocorrelation sequences. Math Programming Series A 2002; 93(3): 331-359
4. Balakrishnan V, Vandenberghe L. Sernidefinite programming duality and linear time-invariant systems. IEEE Trans Auto Control January 2003; AC-48(1): 30-41
5. Bauschke HH, Güler O, Lewis AS, Sendov HS. Hyperbolic polynomials and convex analysis. Canad J Math 2001; 53(3): 470-488
6. Ben-Tal A, El Ghaoui L, Nemirovskii A. Robustness. In: Wolkowitz H, Saigal R, Vandenberghe L. (eds). Handbook of semidefinite programming: theory, algorithms and applications, Kluwer, 2000, pp. 138-162
7. Benson S, Ye Y, Zhang X. DSDP, A dual scaling algorithm for positive semidefinite programming. Available from http://www-unix.mcs.anl.gov~benson/ dsdp/
8. Bochnak J, Coste M, Roy M-F. Real algebraic geometry. Springer, Berlin 1998
9. Borchers B. CSDP, A C Library for sernidefinite programming. Optim methods software 1999; 11(1): 613-623 Available from http://www.nmt.edu/ borchers/csdp.html
10. Boyd S, El Ghaoui L, Feron E, Balakrishnan V. Linear matrix inequalities in system and control theory, vol 15. Studies in applied mathematics. SIAM, Philadelphia, PA, 1994
11. Boyd S, Vandenberghe L. Convex optimization. 2002 Preprint
12. Boyd S, Wu S-P. SDPSOL: a parser/solver for sernidefinite programs with matrix structure. User's guide, version beta. Stanford University, March 1996
13. Burer S, Monteiro RDC. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math Programming 2003; 95(2): 329-357
14. Chesi G, Garulli A, Tesi A, Vicino A. LMI-based techniques for solving quadratic distance problems. In: Proceedings of the 40th IEEE Conference on Decision and Control, December 2001, pp 3587-3592
15. ∞ design with pole placement constraints: an LMI approach. IEEE Trans Auto Control 1996; 41(3): 358-367
16. Doyle JC, Packard A, Zhou K. Review of LFTs, LMIs, and μ. In: Proceedings of the 30th IEEE Conference on Decision and Control, 1991
17. El Ghaoui L, Lebret H. Robust solutions to least-squares problems with uncertain data. SIAM J Matrix Analysis Appli 1997; 18(4): 1035-1064
18. Fujisawa K, Kojima M, Nakata K, Yamashita M. SDPA semidefinite programming algorithm - Version 6.00, 2002. Available from http://www.is.titech. ac.jp/yamashi9/sdpa/
19. Gahinet P, Nemirovski A, Laub AJ, Chilali M. LMI control toolbox. The Math-Works Inc., Natick, Mass., May 1995
20. Garey MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, 1979
21. El Ghaoui L, Niculescu S-I. (eds). Advances on linear matrix inequality methods in control. SIAM, 1999
22. Goemans MX. Semidefinite programming in combinatorial optimization. Math Programming 1997; 79(1-3): 143-161
23. Goemans MX, Williamson DP. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 1995; 42(6): 1115-1145
24. Güler O. Hyperbolic polynomials and interior point methods for convex programming. Math Oper Res 1997; 22(2): 350-377
25. Hansson A, Vandenberghe L. Efficient solution of linear matrix inequalities for integral quadratic constraints. In: Proceedings of the 39th IEEE Conference on Decision and Control, December 2000
26. Helmberg C. SBmethod - A C++ implementation of the spectral bundle method. Available from http://www-user.tu-chemnitz.de/~helmberg/SBmethod/
27. Helton JW, Vinnikov V. Linear matrix inequality representation of sets. Preprint, March 2002. Available from http://math.ucsd.edu/~helton/
28. Henrion D, Lasserre J-B. GloptiPoly - global optimization over polynomials with Matlab and SeDuMi. Available from http://www.laas.fr/~henrion/ software/gloptipoly/
29. Kao CY, Jönsson U, Megretski A. A cutting plane algorithm for robustness analysis of periodically time-varying systems. In: Proceedings of the American Control Conference, 1999
30. Kao CY, Megretski A, Jönsson U. An algorithm for solving optimization problems involving special frequency dependent LMIs. In: Proceedings of the American Control Conference, 2000
31. Labit Y, Peaucelle D, Henrion D. SeDuMi Interface 1.02: a tool for solving LMI problems with SeDuMi. In: Proceedings of the CACSD Conference, Glasgow, September 2002
32. Lasserre JB. Global optimization with polynomials and the problem of moments. SIAM Journal of Optim 2001; 11(3): 796-817
33. Laurent M, Rendl F. Semidefinite programming and integer programming. Technical Report PNA-R0210, CWI, Amsterdam, April 2002
34. Lobo M, Vandenberghe L, Boyd S, Lebret H. Applications of second-order cone programming. Linear Algebra and its Applications November 1998; 284: 193-228
35. Löfberg J. YALMIP: a Matlab interface to SP, MAXDET and SOCP. Technical Report LiTH-ISY-R-2328, Department of Electrical Engineering, Linköping University, SE-581 83 Linkping, Sweden, Jan 2001. Available from http://www.control.isy.liu.se/~johanl/yalmip.html
36. Megretski A, Kao C-Y, Jönsson U, Rantzer A. A guide to IQCβ: software for robustness analysis, June 1998
37. Miller SA, Smith RS. Solving large structured semidefinite programs using an inexact spectral bundle method. In: Proceedings of the 39th IEEE Conference on Decision and Control, December 2000, pp 5027-5032
38. Mittelmann HD. An independent benchmarking of SDP and SOCP solvers. Math Progr 2003; 95:407-430
39. Nesterov YE, Nemirovski A. Interior point polynomial methods in convex programming, vol 13 Studies in Applied Mathematics. SIAM, Philadelphia, PA 1994
40. Packard A, Doyle JC. The complex structured singular value. Automatica 1993; 29(1): 71-109
41. Papachristodoulou A, Prajna S. On the construction of Lyapunov functions using the sum of squares decomposition. In: Proceedings of the 41st IEEE Conference on Decision and Control, December 2002, pp 3482-3487
42. Parrilo PA. On the numerical solution of LMIs derived from the KYP lemma. In: Proceedings of the 38th IEEE Conference on Decision and Control, 1999
43. Parrilo PA. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. PhD thesis, California Institute of Technology May 2000. Available at http://www.cds.caltech.edu/~pablo/
44. Parrilo PA. Semidefinite programming relaxations for semialgebraic problems. Math Prog Series B. Preprint available at http://control.ee.ethz.ch/ ~parrilo/, 2003
45. Parrilo PA, Sturmfels B. Minimizing polynomial functions. In: Basu S, González-Vega L. (eds). Algorithmic and Quantitative Real Algebraic Geometry volume 60 DIMACS Series in Discrete Mathematics and Theoretical Computer Science. AMS, 2003. To appear, available from arXiv:math.OC/0103170
46. Powers V, Wörmann T. An algorithm for sums of squares of real polynomials. Journal of Pure Applied Algebra 1998; 127: 99-104
47. Prajna S, Papachristodoulou A, Parrilo PA. SOS-TOOLS: Sum of squares optimization toolbox for MATLAB, 2002. Available from http://www.cds.caltech. edu/sostools and http://control.ee.ethz.ch/~parrilo/sostools
48. Ramana MV. Polyhedra, spectrahedra, semidefinite programming. In: Pardalos PM, Wolkowicz H. (eds). Topics in semidefinite and interior-point methods, Fields Institute Communications, Vol 18. American Mathematical Society, 1998, pp 27-38
49. Rantzer A. On the Kalman-Yakubovich-Popov lemma. Systems and Control Lett 1996; 28: 7-10
50. Reznick B. Uniform denominators in Hilbert 17th problem. Mathematische Zeitschrift 1995; 220(1): 75-97
51. Reznick B. Some concrete aspects of Hilbert's 17th problem. In: Real algebraic geometry and ordered structures, Contemporary Mathematics (American Mathematical Society), Vol 253, American Mathematical Society, 2000, pp 253
52. Rotea MA, D'Amato FJ. LFTB: an optimized algorithm to bound worst-case frequency response functions. In: Proceedings of the American Control Conference, June 2001, pp 3041-3048
53. Scherer C, Weiland S. Linear Matrix Inequalities in Control. DISC course lecture notes, 2000
54. Seiler P. LMILab translator. Available from http://vehicle.me.berkeley. edu/~guiness/lmitrans.html
55. Shor NZ. Minimization methods for nondifferentiable functions, vol 3. Springer Series in Computational Mathematics. Springer-Verlag, Berlin 1985
56. Sturm J. SeDuMi version 1.05, October 2002. Available from http://fewcal.kub.nl/sturm/software/sedumi.html
57. Tibken B, Dilaver KF. Computation of subsets of the domain of attraction for polynomial systems. In: Proceedings of the 41st IEEE Conference on Decision and Control, December 2002, pp 2651-2656
58. Todd M. Semidefinite optimization. Acta Numerica 2001; 10: 515-560
59. Toh KC, Tütüncü RH, Todd MJ. SDPT3 - a MATLAB software package for semidefinite-quadratic-linear programming. Available from http://www.math.cmu.edu/~reha/sdpt3.html
60. Vandcnberghe L, Boyd S. Semidefinite programming. SIAM Rev March 1996; 38(1): 49-95
61. Vandcnberghe L, Boyd S, Alkire B. SP Version 1.1. Software for Semidefinite Programming, http://www.ee.ucla.edu/~vandenbe/sp.html
62. ∞ norm minimization problems. In: Proceedings of the 40th IEEE Conference on Decision and Control, 2001
63. Willems JC. Least squares stationary optimal control and the algebraic Riccati equation. IEEE Trans Auto Control 1971; 16(6): 621-634
64. Wolkowicz H, Saigal R, Vandenberghe L. (eds). Handbook of semidefinite programming. Kluwer, 2000