Penalty/barrier multiplier algorithm for semidefinite programming

Optimization Methods and Software

Volumn 13, Issue 4, 2000, Pages 235-261

  Mosheyev, Leonid ^a   Zibulevsky, Michael ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; FUNCTION EVALUATION; LAGRANGE MULTIPLIERS; LARGE SCALE SYSTEMS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; ROBUSTNESS (CONTROL SYSTEMS); TRUSSES;

AUGMENTED LAGRANGIAN; LEGENDRE TRANSFORMATION; LINEAR MATRIX INEQUALITY; PENALTY BARRIER FUNCTIONS; PENALTY BARRIER MULTIPLIER ALGORITHM; SEMIDEFINITE PROGRAMMING;

MATHEMATICAL PROGRAMMING;

EID: 0034517243     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780008805787     Document Type: Article

References (29)

1. Alizadeh, F. (1995). Interior Point Methods in semidefinite programming with Applications to Combinatorial Optimization. SIAM J. Optim, 5, 13-51.
2. Ben-Tal, A. and Bendsøe, M. P. (1993). A New Method for Optimal Truss Topology Design. SIAM J. Optim, 3, 322-358.
3. Ben-Tal, A., Kocvara, M., Nemirovski, A. and Zowe. J. Free Material Design via semidefinite programming, Multi-Load Case with Contact Conditions, Optimization Laboratory, Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology (Haifa, Israel, 1997).
4. Ben-Tal, A. and Nemirovski, A. Convex Optimization in Engineering Faculty of Industrial Engineering and Management, Technion (Haifa, Israel, 1998).
5. Ben-Tal, A and Nemirovski, A. (1997). Robust Truss Topology Design via Semidefinite programming. SIAM J. Optim, 7, 991-1016.
6. Ben-Tal, A., Yuzefovich, I. and Zibulevsky, M. Penalty/Barrier Multiplier Methods for Min-max and Constrained Smooth Convex Programs, Research Report 9, Optimization Laboratory, Faculty of Industrial Engineering and Management, Technion (Haifa, Israel, 1992).
7. Ben-Tal, A. and Zibulevsky, M. (1997). Penalty/Barrier Multiplier Methods for Convex Programming Problems. SIAM J. Optim, 7, 347-366.
8. Boyd, S. and El Ghaoui, L. (1993). Method of Centers for Minimizing Generalized Eigenvalues. Linear Algebra Appl., 188, 63-111.
9. Boyd, S., El Ghaoui, L., Feron, E. and Balakrishnan, V. (1994). Linear Matrix Inequalities in System and Control Theory, SIAM Studies in Applied Mathematics (SIAM, Philadelphia, PA,).
10. Breitfeld, M. G. and Shanno, D. F. (1994). A Globally Convergent Penalty-Barrier Algorithm for Nonlinear Programming and its Computational Performance, Rutcor Research Report (Rutgers University, New Jersey,).
11. Doljansky, M. and Teboulle, M. (1998). An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming. SIAM J. Optim., 9(1), 1-13.
12. Gahinet, P. and Nemirovski, A. (1997). The Projective Method for Solving Linear Matrix Inequalities. Math. Programming Series B, 77, 163-190.
13. Gahinet, P., Nemirovski, A., Laub, A. J. and Chilali, M. (1995). LMI Control Toolbox, The MathWorks Inc.
14. Iusem, A. N., Svaiter, B. and Teboulle, M. (1994). Entropy-Like Proximal Methods in Convex Programming. Math. Oper. Res., 19, 790-814.
15. Jarre, F. (1993). An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices. SIAM J. Control Optim, 31, 1360-1377.
16. Kort, W. B. and Bertsekas, D. P. (1973). Multiplier Methods for Convex Programming, Proc 1073 IEEE Conf. Decision Control, (San-Diego, Calif., 428-432).
17. Lewis, A. S. (1996). Convex Analysis on the Hermitian Matrices. SIAM J. Optim., 6, 164-177.
18. Nemirovski, A. personal communication.
19. Nesterov, Yu. and Nemirovski, A. (1994). Interior Point Polynomial Algorithms in Convex Programming: Theory and Applications, SIAM Studies in Applied Mathematics (SIAM, Philadelphia, PA).
20. Nesterov, Yu. and Nemirovski, A. (1994). Multi-Parameter Surfaces of Analytic Centers and long-step path-following interior point methods, Research Report 2, Optimization Laboratory, Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology (Haifa, Israel).
21. Overton, M. L. and Womersley, R. S. (1993). Optimality Conditions and Duality Theory for Minimizing sums of the largest eigenvalues of symmetric matrices. Math. Programming Series B, 62, 321-357.
22. Polyak, R. (1992). Modified Barrier Functions: Theory and Methods. Math. Programming, 54, 177-222.
23. Rockafellar, R. T. (1970). Convex Analysis, Princeton University Press (Princeton, NJ).
24. Shor, N. Z. (1985). Minimization Methods for Nondifferentiable Functions (Springer, Berlin).
25. Teboulle, M. (1992). Entropic Proximal Mappings with Applications to Nonlinear Programming. Mathematics of Operations Research, 17.
26. Tseng, P. and Bertsekas, D. (1993). On the Convergence of the Exponential Multiplier Method for Convex Programming. Math. Programming, 60, 1-19.
27. Vandenberghe, L. and Boyd, S. (1996). Semidefinite Programming. SIAM Review, 38, 49-95.
28. Zibulevsky, M. (1995). New Penalty/Barrier and Lagrange Multiplier Approach for Semidefinite Programming, Research Report 5, Optimization Laboratory, Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology (Haifa, Israel). http://iew3.technion.ac.il:8080/-mcib/
29. Zibulevsky, M. Penalty/Barrier Multiplier Methods for Large-Scale Nonlinear and Semidefinite Programming, Ph.D. Thesis (Technion, Haifa, Israel, 1996). http://iew3.technion.ac.il:8080/-mcib/