Interior-point algorithms for semidefinite programming problems derived from the KYP lemma

Lecture Notes in Control and Information Sciences

Volumn 312, Issue , 2005, Pages 195-238

  Vandenberghe, Lieven ^a   Balakrishnan, V Ragu ^b   Wallin, Ragnar ^c   Hansson, Anders ^c   Roh, Tae ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b PURDUE UNIVERSITY   (United States)

^c LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; NONLINEAR PROGRAMMING; SIGNAL PROCESSING;

CONTROL AND SIGNAL PROCESSING; FAST IMPLEMENTATION; IN-CONTROL; INTERIOR POINT ALGORITHM; KALMAN-YAKUBOVICH-POPOV LEMMA; KYP LEMMA; PRIMAL-DUAL INTERIOR POINT METHODS; SEMI-DEFINITE PROGRAM (SDP); SEMIDEFINITE PROGRAMMING PROBLEM; SIGNAL PROCESSING APPLICATIONS;

APPLICATION PROGRAMS;

EID: 33750916164     PISSN: 01708643     EISSN: None     Source Type: Book Series    
DOI: 10.1007/10997703_12     Document Type: Article

References (54)

1. P. Apkarian and R. J. Adams (1998). Advanced gain-scheduled techniques for uncertain systems. IEEE Trans. Control Sys. Tech., 6(1):21-32.
2. ∞ controllers. IEEE Trans. Aut. Control, 40(5):853-864.
3. F. Alizadeh, J. P. Haeberly, M. V. Nayakkankuppam, M. L. Overton, and S. Schmieta (1997). SDPPACK User's Guide, Version 0.9 Beta. NYU.
4. B. Alkire and L. Vandenberghe (2000). Handling nonnegative constraints in spectral estimation. Proceedings of the 34th Asilomar Conference on Signals, Systems, and Computers, 202-206.
5. B. Alkire and L. Vandenberghe (2001). Interior-point methods for magnitude filter design. Proceedings of the 2001 IEEE International Conference on Acoustics. Speech, and Signal Processing.
6. B. Alkire and L. Vandenberghe (2002). Convex optimization problems involving finite autocorrelation sequences. Mathematical Programming Series A, 93:331-359.
7. S. Boyd and C. Barratt (1991). Linear Controller Design: Limits of Performance. Prentice Hall.
8. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan (1994). Linear Matrix Inequalities in System and Control Theory. Volume 15 of Studies in Applied Mathematics. SIAM, Philadelphia, PA.
9. B. Borchers (2002). CSDP 4.2 User's Guide. Available from www.nmt.edu/~borchers/csdp.html. 10. V. Balakrishnan and L. Vandenberghe (1998). Linear Matrix Inequalities for signal processing: An overview. Proceedings of the 32nd Annual Conference on Information Sciences and Systems, Princeton, New Jersey.
10. V. Balakrishnan and L. Vandenberghe (2003). Semidefinite programming duality and linear time-invariant systems. IEEE Trans. Aut. Control, 48:30-41.
11. V. Balakrishnan and F. Wang (1999). Efficient computation of a guaranteed lower bound on the robust stability margin for a class of uncertain systems. IEEE Trans. Aut. Control, AC-44(11):2185-2190.
12. S. J. Benson and Y. Ye (2002). DSDP4 - A Software Package Implementing the Dual-Scaling Algorithm for Semidefinite Programming. Available from www-unix.mes.anl.gov/~benson.
13. T. N. Davidson, Z.-Q. Luo, and J. F. Sturm (2002). Linear matrix inequality formulation of spectral mask constraints with applications to FIR filter design. IEEE Transactions on Signal Processing, 50(11):2702-2715.
14. J. Doyle (1982). Analysis of feedback systems with structured uncertainties. IEE Proc., 129-D(6):242-250.
15. B. Dumitrescu, I. Tabus, and P. Stoica (2001). On the parametrization of positive real sequences and MA parameter estimation. IEEE Transactions on Signal Processing, 49(11):2630-9.
16. M. Fu and N. E. Barabanov (1997). Improved Upper Bounds for the Mixed Structured Singular Value. IEEE Trans. Aut. Control, 42(10):1447-1452.
17. K. Fujisawa, M. Kojima, and K. Nakata (1998). SDPA User's Manual. Available from www.is.titech.ac.jp/~yamashi9/sdpa.
18. M. K. H. Fan, A. L. Tits, and J. C. Doyle (1991). Robustness in the presence of mixed parametric uncertainty and unmodeled dynamics. IEEE Trans. Aut. Control, AC-36(1):25-38.
19. J. Gillberg and A. Hansson (2003). Polynomial complexity for a Nesterov-Todd potential-reduction method with inexact search directions. Proc. IEEE Conference on Decision and Control.
20. Y. Genin, Y. Hachez, Yu. Nesterov, and P. Van Dooren (2000). Convex optimization over positive polynomials and filter design. Proc. UKACC International Conference on Control, Cambridge University.
21. Y. Genin, Y. Hachez, Yu. Nesterov, and P. Van Dooren (2003). Optimization problems over positive pseudo-polynomial matrices. SIAM Journal on Matrix Analysis and Applications, 25(3):57-79.
22. M. Green and D. J. N. Limebeer (1995). Linear Robust Control. Information and System sciences. Prentice Hall, Englewood Cliffs, NJ.
23. P. Cabinet and A. Nemirovskii (1995). LMI Control Toolbox for Matlab. The MathWorks, Inc.
24. Y. Hachez (2003). Convex Optimization over Non-Negative Polynomials: Structured Algorithms and Applications. PhD thesis, Université Catholique de Louvain, Belgium.
25. ∞-optimal control via finitedimensional Q-parametrization and linear matrix inequalities. Proc. American Control Conf.
26. D. Henrion (2003). LMI formulations of polynomial matrix problems in robust control. Draft.
27. A. Hansson and L. Vandenberghe (2000). Efficient solution of linear matrix inequalities for integral quadratic constraints. Proc. IEEE Conf. on Decision and Control, 5033-5034.
28. A. Hansson and L. Vandenberghe (2001). A primal-dual potential reduction method for integral quadratic constraints. Proc. American Control Conference, 3013-3018, Arlington, Virginia.
29. T. Iwasaki and S. Hara (1998). Well-posedness of feedback systems: Insights into exact robustness analysis and approximate computations. IEEE Trans. Aut. Control, AC-43(5):619-630.
30. U. Jönsson (1996). Robustness Analysis of Uncertain and Nonlinear Systems. PhD thesis, Lund Institute of Technology, Sweden.
31. C.-Y. Kao and A. Megretski (2001). Fast algorithms for solving IQC feasibility and optimization problems. Proc. American Control Conf., 3019-3024.
32. C.-Y. Kao, A. Megretski, and U. T. Jönsson (2001). A cutting plane algorithm for robustness analysis of periodically time-varying systems. IEEE Trans. Aut. Control, 46(4):579-592.
33. C.-Y. Kao, A. Megretski, and U. Jönsson (2003). Specialized fast algorithms for IQC feasibility and optimization problems. Submitted for publication.
34. J. Kautsky, N. K. Nichols, and P. Van Dooren (1985). Robust pole assignment in linear state feedback. Int. J. Control, 41:1129-1155.
35. J. Löfberg (2002). YALMIP. Yet another LMI parser. University of Linköping, Sweden.
36. S. Mehrotra (1991). On the implementation of a primal-dual interior point method. SIAM Journal on Optimization, 2(4):575-601.
37. A. Megretski and A. Rantzer (1997). System analysis via integral quadratic constraints. IEEE Trans. Aut. Control, 42(6):819-830.
38. J. Oishi and V. Balakrishnan (1999). Linear controller design for the NEC laser bonder via LMI optimization. In Laurent El Ghaoui and Silviu-Iulian Niculescu (Editors). Advances in Linear Matrix Inequality Methods in Control. Advances in Control and Design. SIAM.
39. A. Packard (1994). Gain scheduling via linear fractional transformations. Syst. Control Letters, 22:79-92.
40. P. A. Parrilo (2000). Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization. PhD thesis, California Institute of Technology, Pasadena, California.
41. A. Rantzer (1996). On the Kaiman-Yakubovich-Popov lemma. Syst. Control Letters, 28(1):7-10.
42. M. G. Safonov (1982). Stability margins of diagonally perturbed multivariable feedback systems. IEE Proc., 129-D:251-256.
43. J. F. Sturm (2001). Using SEDUMI 1.02, a Matlab Toolbox for Optimization Over Symmetric Cones. Available from fewcal.kub.nl/sturm/software/sedumi.html.
44. J. F. Sturm (2002). Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optimization Methods and Software, 17(6):1105-1154.
45. M. J. Todd, K. C. Toh, and R. H. Tütüncü (1998). On the Nesterov-Todd direction in semidefinite programming. SIAM J. on Optimization, 8(3):769-796.
46. K. C. Toh, R. H. Tütüncü, and M. J. Todd (2002). SDPT3 version 3.02. A Matlab software for semidefinite-quadratic-linear programming. Available from www.math.nus.edu.sg/~mattolikc/sdpt3.html.
47. S.-P. Wu and S. Boyd (1996). SDPSOL: A Parser/Solver for Semidefinite Programming and Determinant Maximization Problems with Matrix Structure. User's Guide, Version Beta. Stanford University.
48. F. Wang and V. Balakrishnan (2002). Improved stability analysis and gainscheduled controller synthesis for parameter-dependent systems. IEEE Trans. Aut. Control, 47(5):720-734.
49. S.-P. Wu, S. Boyd, and L. Vandenberghe (1998). FIR filter design via spectral factorization and convex optimization. In B. Datta (Editor). Applied and Computational Control, Signals, and Circuits, 1:215-245, Birkhauser.
50. F. Wang, V. Balakrishnan, P. Zhou, J. Chen, R. Yang, and C. Frank (2003). Optimal array pattern synthesis using semidefinite programming. IEEE Trans. Signal Processing, 51(5):1172-1183.
51. R. Wallin, H. Hansson, and L. Vandenberghe (2003). Comparison of two structure-exploiting optimization algorithms for integral quadratic constraints. Proc. IFAC Symposium on Robust Control Design, Milan, Italy.
52. J. C. Willems (1971). Least squares stationary optimal control and the algebraic Riccati equation. IEEE Trans. Aut. Control, AC-16(6):621-634.
53. K. Zhou, J. Doyle, and K. Glover (1996). Robust and Optimal Control. Prentice Hall.
54. Y. Zhang (1998). On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. on Optimization, 8:365-386.