Specialized fast algorithms for IQC feasibility and optimization problems

Automatica

Volumn 40, Issue 2, 2004, Pages 239-252

  Kao, Chung Yao ^a   Megretski, Alexandre ^b   Jönsson, Ulf ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Cutting plane method; Integral quadratic constraint; Positive real lemma; Semidefinite programming; Stability analysis

Indexed keywords

ALGORITHMS; INTEGRAL EQUATIONS; LARGE SCALE SYSTEMS; MATRIX ALGEBRA; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS);

INTEGRAL QUADRATIC CONSTRAINT (IQC); SEMI-DEFINITE PROGRAMS (SDP);

SYSTEM STABILITY;

EID: 0347355016     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.automatica.2003.09.016     Document Type: Article

References (41)

1. Akgül M. Topics in relaxation and ellipsoidal methods. Research notes in mathematics. Vol. 97:1984;Pitman, London.
2. Atkinson D.S., Vaidya P.M. A cutting plane algorithm for convex programming that uses analytic centers. Mathematical Programming. 69(B):1995;1995.
3. Bahn O., du Merle O., Goffin J.-L., Vial J.-P. A cutting plane method from analytical centers for stochastic programming. Mathematical Programming Series B. 69(1):1995;45-73.
4. Balas, G. J., Doyle, J. C., Glover, K., Packard, A., & Smith, R. (1993). μ -Analysis and synthesis toolbox. Cambridge, MA: The Math Works Inc.
5. Boyd S.P., Barratt C.H. Linear controller design - limits of performance. 1991;Prentice-Hall, Englewood Cliff, NJ.
6. Doyle, J., Packard, A., & Zhou, K. (1991). Review of LFTs, LMIs, and μ . In Proceedings of the 30th conference on decision and control, Brighton, England.
7. Goffin J.-L., Gondzio J., Sarkissian R., Vial J.-P. Solving nonlinear multicommodity flows problems by the analytical center cutting plane method. Mathematical Programming. 76:1997;131-154.
8. Goffin J.-L., Haurie A., Vial J.-P. Decomposition and nondifferentiable optimization with the projective algorithm. Management Science. 38(2):1992;284-302.
9. Goffin J.-L., Luo Z.-Q., Ye Y. Complexity analysis of an interior cutting plane method for convex feasibility problems. SIAM Journal of Optimization. 6(3):1996;638-652.
10. Goffin J.-L., Mokhtarian F.S. Using the primal dual infeasible Newton method in the analytical method for problems defined by deep cutting planes. Journal of Optimization Theory and Applications. 101:1999;35-58.
11. Goffin J.-L., Vial J.-P. Cutting planes and column generation techniques with the projective algorithm. Journal of Optimization Theory and Applications. 65:1989;409-429.
12. Goffin, J.-L., & Vial, J.-P. (1999a). Convex nondifferentiable optimization: A survey focused on the analytical center cutting plane method. Technical Report 99.02, HEC/Logilab.
13. Goffin J.-L., Vial J.-P. Shallow, deep and very deep cuts in the analytical center cutting plane method. Mathematical Programming. 84:1999;89-103.
14. Goffin J.-L., Vial J.-P. A two-cuts approach in the analytical center cutting plane method. Mathematical Methods of Operations Research. 49(1):1999;149-169.
15. Goffin J.-L., Vial J.-P. Multiple cuts in the analytical center cutting plane method. SIAM Journal of Optimization. 11(1):2000;266-288.
16. Grötschel M., Lovász L., Schrijver A. Geometric algorithms and combinatorial optimization. 1993;Springer, Berlin.
17. Hansson, A., & Vandenberghe, L. (2000). Efficient solution of linear matrix inequalities for integral quadratic constraints. In Proceedings of the 39th IEEE conference on decision and control, Sydney, Australia.
18. Hansson, A., & Vandenberghe, L. (2001). A primal-dual potential reduction method for integral quadratic constraints. In Proceedings of the 2001 American control conference, Arlington, VA.
19. Jönsson, U. (1996). Robustness analysis of uncertain and nonlinear systems. Ph.D. thesis, Department of Automatic Control, Lund Institute of Technology, Sweden.
20. Kao, C.-Y. (2002). Efficient computational algorithms for robustness analysis. Ph.D. thesis, Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA.
21. Kao, C.-Y. (2003). Solvers for IQC Optimization Problems based on Cutting Plane Methods. Available upon request. Send e-mail to cykao@alum.mit.edu.
22. Kao, C.-Y., Megretski, A., & Jönsson, U. (2000). An algorithm for solving special frequency dependent LMIs. In Proceedings of the American control conference 2000, Chicago, Illinois, USA.
23. Khachiyan L.G. A polynomial algorithm in linear programming. Soviet Mathematics Doklady. 20:1979;191-194.
24. Megretski A. Lecture notes on multivariable control systems. 2000;MIT, Cambridge, MA.
25. Megretski A., Rantzer A. System analysis via integral quadratic constraints. IEEE Transactions on Automatic Control. 42(6):1997;819-830.
26. Nesterov Y. Cutting plane algorithms from analytical centers. Efficient estimates Mathematical Programming. 69(B):1995;149-176.
27. Nesterov, Y., & Nemirovski, A. (1994). Interior point polynomial methods in convex programming. Studies in applied mathematics, Vol. 13. Philadelphia, PA: SIAM.
28. Parrilo, P. A. (1999). On the numerical solution of LMIs derived from the KYP lemma. In Proceedings of the 38th IEEE conference on decision and control, Vol. 3. Phoenix, Arizona, USA.
29. Rantzer A. On the Kalman-Yakubovich-Popov lemma. Systems and Control Letters. 28(1):1996;7-10.
30. Safonov M.G., Athans M. A multi-loop generalization of the circle criterion for stability margin analysis. IEEE Transactions on Automatic Control. 26:1981;415-422.
31. Sonnevand, G. (1986). New algorithms in convex programming based on a notion of 'centre' (for systems of analytical inequalities) and on rational extrapolation. In k. H. Hoffmann, J. B. Hiriart-Urruty, C. Lemaréchal, & J. Zowe (Eds.), Trends in mathematical optimization: Proceedings of the fourth French-German conference on optimization. Irsee West-Germany.
32. Vandenberghe L., Boyd S. Semidefinite programming. SIAM Review. 38(1):1996;49-95.
33. Wallin, R., Hansson, A., & Vandenberghe, L. (2001). Efficient implementations of interior-point methods for integral quadratic constraints. In Fourth SIAM conference on linear algebra in signals, systems and control, Cambridge, MA.
34. Willems J.C. Least squares stationary optimal control and the algebraic Riccati equation. IEEE Transactions on Automatic Control. 16(6):1971;621-634.
35. Willems J.C. Dissipative dynamical system, Part I. General theory Archive for Rational Mechanics and Analysis. 45:1972;321-353.
36. Yakubovich V.A. Solution of certain matrix inequalities occurring in the theory of automatic control. Docl. Acad. Nauk. SSSR. 143:1962;1304-1307.
37. Yakubovich V.A. Frequency conditions for the absolute stability of control systems with several nonlinear or linear nonstationary blocks. Avtomatika i Telemekhanika. 6:1967;5-30.
38. Ye Y. A potential reduction algorithm allowing column generation. SIAM Journal of Optimization. 2:1992;7-20.
39. Ye Y. Complexity analysis of the analytical center cutting plane method that uses multiple cuts. Mathematical Programming. 78:1997;85-104.
40. Ye Y. Inter point algorithms, theory and analysis. 1997;Wiley, New York.
41. Zhou K., Doyle J.C., Glover K. Robust and optimal control. 1996;Prentice-Hall, Englewood Cliffs, NJ: Prentice-Hall