Newton-type methods with generalized distances for constrained optimization

Optimization

Volumn 41, Issue 3, 1997, Pages 257-278

  Iusem, Alfredo N ^a   Solodov, Michael V ^a  

^a INSTITUTO DE PESQUISAS JARDIM BOTÂNICO DO RIO DE JANEIRO   (Brazil)

Author keywords

Constrained optimization; Generalized distances; Newton method; Proximal point methods

Indexed keywords

EID: 0031443883     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331939708844339     Document Type: Article

References (19)

1. Armijo, L. (1996). Minimization of functions having Lipschitz continuous first partial derivatives. Pacific Journal of Mathematics, 16, 1 -3.
2. Bregman, L. M. (1967). The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics, 7(3), 200-217.
3. Burachik, R. S. and Iusem, A. N. (1995). A generalized proximal point algorithm for the variational inequality problem in a Hilbert space. Technical Report MAT-07/95, Pontificia Universidade Catolica, Rio de Janeiro, Brazil. SIAM J. on Optimization, accepted for publication.
4. Censor, Y., Iusem, A. N. and Zenios, S. A. (1994). An interior point method with Bregman functions for the variational inequality problem with paramonotone operators. Technical Report 94-03, Department of Public and Business Administration, University of Cyprus, Nicosia, Cyprus. Mathematical Programming, accepted for publication.
5. Censor, Y. and Zenios, S. (1992). The proximal minimization algorithm with D-functions. Journal of Optimization Theory and Applications, 73, 451-464.
6. Chen, G. and Teboulle, M. (1993). Convergence analysis of proximal-like optimization algorithm using Bregman functions. SIAM Journal on Optimization, 3, 538-543.
7. Cottle, R. W., Pang, J.-S. and Stone, R. E. (1992). The Linear Complementarity Problem. Academic Press, New York.
8. De Pierro, A. R. and Iusem, A. N. (1986). A relaxed version of Bregman's method for convex programming. Journal of Optimization Theory and Applications, 51, 421-440.
9. Dennis, J. E. and Schnabel, R.B. (1983). Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs, N. J.
10. Eckstein, J. (1993). Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Mathematics of Operations Research, 18, 202-226.
11. Eggermong, P. B. (1990). Multiplicative iterative algorithms for convex programming. Linear Algebra and its Applications, 130, 25-32.
12. Friedlander, A., Martinez, J. M. and Santos, S. A. (1995). Solution of linear complementarity problems using minimization with simple bounds. Journal of Global Optimization, 6, 253-267.
13. Iusem, A. N. (1994). Steepest descent methods with generalized distances for constrained optimization. Acta Applicandae Mathematicae, accepted for publication.
14. Iusem, A. N. (1995). On some properties of generalized proximal point methdos for quadratic and linear programming. Journal of Optimization Theory and Applications, 85, 596-612.
15. Lemarie, B. (1989). The proximal algorithm. In Penot, J. P. editor, International Series of Numerical Mathematics, pages 73-87. Birkhauser, Basel.
16. Mangasarian, O. L. (1969). Nonlinear Programming. McGraw-Hill, New York.
17. Polyak, B. T. (1987). Introduction to Optimization. Optimization Software, Inc., Publications Division, New York.
18. Rockafellar, R. T. (1976). Monotone operators and the proximal point algorithm. SIAM Journal on Control and Optimization, 14(5), 877-898.
19. Solodov, M. V. and Tseng, P. (1996). Modified projeciton-type methods for monotone variational inequalities. SIAM Journal on Control and Optimization, 34, 1814-1830.