An interior proximal algorithm and the exponential multiplier method for semidefinite programming

SIAM Journal on Optimization

Volumn 9, Issue 1, 1998, Pages 1-13

  Doljansky, Moshe ^a   Teboulle, Marc ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Augmented Lagrangian multiplier methods; Exponential penalty; Proximal like methods; Semidefinite optimization

Indexed keywords

EID: 0032251602     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496309405     Document Type: Article

References (21)

1. F. ALIZADEH, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim., 5 (1995), pp. 13-51.
2. A. AUSLENDER AND M. HADDOU, An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities, Math. Programming, 71 (1995),
3. H. H. BAUSCHKE AND J. M. BORWEIN, Legendre functions and the method of random Bregman projections, J. Convex Anal., 4 (1997), pp. 27-67.
4. A. BEN-TAL, I. YUZEFOVICH, AND M. ZIBULEVSKY, Penalty/Barrier Multiplier Methods for Minimax and Constrained Smooth Convex Programs, Research report 9-92, Optimization Laboratory, Technion, Israel, 1992.
5. A. BEN-TAL AND M. ZIBULEVSKY, Penalty/barrier multiplier methods for convex programming problems, SIAM J. Optim., 7 (1997), pp. 347-366.
6. D. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
7. M. G. BREITFELD AND D. F. SHANNO, Computational Experience with Modified Log-barrier Methods for Nonlinear Programming, Rutcor research report 17-93, Rutgers University, New Brunswick, NJ, 1993.
8. G. CHEN AND M TEBOULLE, Convergence analysis of a proximal-like minimization algorithm using Bregman functions, SIAM J. Optim., 3 (1993), pp. 538-543.
9. J. ECKSTEIN, Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming, Math. Oper. Res., 18 (1993), pp. 202-226.
10. O. GÜLER, On the convergence of the proximal point algorithm for convex minimization, SIAM J. Control Optim., 29 (1991), pp. 403-419.
11. R. A. HORN AND C. R. JOHNSON, Topics in Matrix Analysis, Cambridge University Press, New York, 1991.
12. A. IUSEM AND M. TEBOULLE, Convergence rate analysis of nonquadratic proximal methods for convex and linear programming, Math. Oper. Res., 20 (1995), pp. 657-677.
13. B. LEMAIRE, About the convergence of the proximal method, in Advances in Optimization, Lecture Notes in Econom. and Math. Systems 382, D. Pallaschke, ed., Springer-Verlag, Berlin, 1992, pp. 39-51.
14. A. W. MARSHALL AND I. OLKIN, Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979.
15. B. MARTINET, Perturbation des méthodes d'optimisation. Applications, RAIRO Anal. Numér., 12 (1978), pp. 153-171.
16. R. A. POLYAK, Modified barrier functions (theory and methods), Math. Programming, 54 (1992), pp. 177-222.
17. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
18. R. T. ROCKAFELLAR, Monotone operators and the proximal point algorithm, SIAM J. Control Optim., 14 (1976), pp. 877-898.
19. M. TEBOULLE, Entropic proximal mappings with application to nonlinear programming, Math. Oper. Res., 17 (1992), pp. 670-690.
20. P. TSENG AND D. BERTSEKAS, On the convergence of the exponential multiplier method for convex programming, Math. Programming, 60 (1993), pp. 1-19.
21. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.