Local convergence of an augmented Lagrangian method for matrix inequality constrained programming

Optimization Methods and Software

Volumn 22, Issue 5, 2007, Pages 777-802

  Noll, Dominikus ^a  

^a INSTITUT DE MATHÉMATIQUES DE TOULOUSE   (France)

Author keywords

Augmented Lagrangian; Implicit function theorem; Matrix inequality; Nonlinear semidefinite programming; Spectral penalty

Indexed keywords

CONSTRAINED OPTIMIZATION; CONVERGENCE OF NUMERICAL METHODS; FUNCTION EVALUATION; NONLINEAR PROGRAMMING; THEOREM PROVING;

AUGMENTED LAGRANGIAN; IMPLICIT FUNCTION THEOREM; MATRIX INEQUALITY; NONLINEAR SEMIDEFINITE PROGRAMMING; SPECTRAL PENALTY;

LAGRANGE MULTIPLIERS;

EID: 34548133207     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780701223970     Document Type: Article

References (46)

1. Vandenberghe, L., Saigal, R. and Wolkowitz, H. (Eds), 2000, Handbook of Semidefinite Programming. Theory, Algorithms and Applications, Vol. 27, International Series in Operations Research and Academic Publisher Management Science (Kluwer).
2. Overton, M.L., 1992, Large-scale optimization of eigenvalues. SIAM Journal on Optimization, 2(1), 88-120.
3. Polak, E. and Wardi, Y., 1982, Nondifferentiable optimization algorithm for designing control systems having singular value inequalities. Automatica, 18(3), 267-283.
4. Fletcher, R., 1985, Semidefinite constraints in optimization. SIAM Journal, of Control Optimization, 23, 493-513.
5. Lemaréchal, C. and Oustry, F., 2000, Non-smooth algorithms to solve semidefinite programs. In: L. El Ghaoui, L. Niculescu (Eds) Advances in LMI Methods in Control, SIAM Advances in Design, and Control Series.
6. Helmberg, C. and Rendl, F., 2000, A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10(3), 673-696.
7. Shapiro, A., 1985, Extremal problems on the set of non-negative matrices. Linear Algebra and its Applications, 67, 7-18.
8. Apkarian, P. and Noll, D., 2006, Controller design via non-smooth multi-directional search. SIAM Journal, of Control and Optimization, 44(6), 1923-1949.
9. ∞-synthesis. IEEE Transactions on Automatic Control, 51(1), 71-86.
10. ∞ synthesis. European Journal of Control, 12(3), 229-244.
11. Apkarian, P. and Noll, D., 2007, Non-smooth optimization for multiband frequency domain control design. Automatica, 43(4), 724-731.
12. Apkarian, P., Noll, D. and Prot, O., Trust region spectral bundle method for non-convex maximum eigenvalue functions. Submitted.
13. Noll, D., Apkarian, P., 2005, Spectral bundle methods for non-convex maximum eigenvalue functions: First-order methods. Mathematical Programming Series B, 104(2), 701-727.
14. Noll, D. and Apkarian, P., 2005, Spectral bundle methods for non-convex maximum, eigenvalue functions: Second-order methods, Mathematical Programming Series B, 104(2), 729-747.
15. Noll, D., Bompart, V. and Apkarian, P., 2007, Second order nonsmooth optimization for feedback control. Numerische Mathematik, in press.
16. Fares, B., Noll, D. and Apkarian, P., 2002, Robust control via successive semidefinite programming. SIAM Journal on Control Optimization, 40, 1791-1820.
17. Jarre, F., 2001, Some aspects of non-linear semidefinite programming. System Modelling and Optimization, 55-69.
18. Leibfritz, Fand Mostafa, E.M.E., 2002, An interior point constrained trust region method for a special class of non-linear semi-definite programming problems. SIAM Journal on Optimization, 12, 1048-1074.
19. Leibfritz, Fand Mostafa, M.E., 2000, Trust region methods for solving the optimal output feedback design problem. International Journal of Control, 76, 501-519.
20. Ben-Tal, A. and Zibulevski, M., 1997, Penalty barrier multiplier methods for convex programming problems. SIAM Journal of Optimization, 7, 347-366.
21. Zibulevski, M., 1996, Penalty barrier multiplier methods for large-scale nonlinear and semidefinite programming. PhD Thesis, Technion, Israel.
22. Mosheyev, L. and Zibulevsky, M., 2000, Penalty barrier multiplier algorithm for semidefinite programming. Optimization Methods and Software, 13, 235-261.
23. Kocvara, M. and Stingl, M., 2003, PENNON: a generalized augmented Lagrangian method for semidefinite programming. Optimization, Methods and Software, 18(3), 317-333.
24. Kocvara, M. and Stingl, M., 2007, On the solution of large-scale SDP problems by the modified barrier method using iterative solvers. Mathematical Programming Series B, 109(2-3), 413-444.
25. Stingl, M., 2005, On the solution of nonlinear semidefinite programs by augmented Lagrangian methods. PhD Thesis, Institute of Applied Mathematics, Universität Erlangen-Nürnberg.
26. ∞ control design via an augmented Lagrangian method. International Journal of Robust and Nonlinear Control, 13, 1137-1148.
27. Fares, B., Apkarian, P. and Noll, D., 2001, An augmented Lagrangian. method for a class of LMI constrained problems in robust control theory. International Journal of Control, 74, 348-360.
28. Thevenet, J.-B., Apkarian, P. and Noll, D., Reduced-order output feedback control design with specSDP, a code for linear/nonlinear SDP problems. Submitted.
29. Thevenet, J., Noll, D. and Apkarian, P., 2005, Nonlinear spectral SDP method for BMI-constrained problems: Applications to control design. Informatics in Control, Automation, and Robotics (Kluwer Academic Publisher).
30. Thevenet, J., Noll, D. and Apkarian, P., Nonsmooth methods for large bilinear matrix inequalities: Applications to feedback control. Submitted.
31. Bellman, R., 1960, Introduction to Matrix Analysis (New York: McGraw-Hill Book Company).
32. Shapiro, A., On differentiability of symmetric matrix valued functions. Published electronically in Optimization Online.
33. Sendov, H., 2006, Generalized Hadamard Product and the Derivatives of Spectral Functions. SIAM Journal on Matrix Analysis and Applications, 28(3), 667-681.
34. Hestenes, M.R., 1969, Multiplier and gradient methods. Journal of Optimization Theory and Applications, 4, 303-320.
35. Powell, M.J.D., 1969, A method for nonlinear constraints in minimization problems. In: R. Fletcher (Ed.) Optimization (New York: Academic Press), pp. 283-298.
36. Rockafellar, R.T., 1974, Augmented Lagrange multiplier functions and duality in non-convex programming SIAM Journal of Control, 12, 268-285.
37. Bertsekas, D.P., 1982, Constrained Optimization and Lagrange Multiplier Methods (Academic Press).
38. Bonnans, F. and Shapiro, A., 2000, Perturbation Analysis of Optimization Problems, Springer Series in Operations Research (Springer-Verlag).
39. Birgin, E.G., Castillo, R.A. and Martinez, J.M., 2005, Numerical comparison of augmented Lagrangian algorithms for non-convex problems. Computational, Optimization and Applications, 31(1), 31-56.
40. Noll, D. and Thevenet, J.-B., Augmented Lagrangian methods with smooth penalty functions. Submitted.
41. Shapiro, A., 1997, First and second order analysis of nonlinear semidefinite programs. Mathematical Programming, 77, 301-320.
42. Bertsekas, D.P., 1995, Nonlinear Programming (Athena Scientific).
43. Boggs, R.T. and Tolle, J.W., 1980, Augmented Lagrangians which are quadratic in the multiplier. Journal of Optimization Theory and Applications, 73, 17-26.
44. Conn, A.R., Gould, N.I.M. and Toint, Ph., 1991, A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds. SIAM Journal of Numerical Analysis, 28(2), pp. 545-572.
45. DiPillo, G. and Grippo, L., 1979, A new class of augmented Lagrangians in nonlinear programming. SIAM Journal on Control and Optimization, 17, 618-628.
46. Noll, D., Torki, M. and Apkarian, P., 2004, Partially augmented Lagrangian method for matrix inequalities. SIAM Journal on Optimization, 15(1), 161-184.