Newton-type Methods with Generalized Distances For Constrained Optimization

References

• Armijo , L. 1996 . Minimization of functions having Lipschitz continuous first partial derivatives . Pacific Journal of Mathematics , 16 : 1 – 3 .
   Web of Science ®Google Scholar
• 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 .
   Google Scholar
• Burachik R. S. Iusem A. N. A generalized proximal point algorithm for the variational inequality problem in a Hilbert space Pontificia Universidade Catolica Rio de Janeiro, , Brazil 1995 Technical Report MAT- 07/95 S1A.V J. on Optimization, accepted for publication
   Google Scholar
• Censor Y. Iusem A. N. Zenios S. A. An interior point method with Bregman functions for the variational inequality problem with paramonotone operators Department of Public and Business Administration, University of Cyprus Nicosia, Cyprus 1994 Technical Report 94-03 Mathematical Programming. accepted for publication
   Google Scholar
• Censor , Y. and Zenios , S. 1992 . The proximal minimization algorithm with D-functions . Journal of Optimization Theory and Applications , 73 ( 3 ) : 451 – 464 .
   Web of Science ®Google Scholar
• Chen , G. and Teboulle , M. 1993 . Convergence analysis of proximal-like optimization algorithm using Bregman functions . SIAM Journal on Optimization , 3 ( 3 ) : 538 – 543 .
   Web of Science ®Google Scholar
• Cottle , R.W. , Pang , J.S. and Stone , R.E. 1992 . The Linear Complementarity Problem , New York : Academic Press .
   Google Scholar
• De Pierro , A.R. and Jusem , A.N. 1986 . A relaxed version of Bregman’s method for convex programming . Journal of Optimization Theory and Applications , 51 : 421 – 440 .
   Web of Science ®Google Scholar
• Dennis , J.E. and Schnabel , R.B. 1983 . Numerical Methods for Unconstrained Optimization and Nonlinear Equations , Englewood Cliffs, N.J : Prentice-Hall .
   Google Scholar
• Eckstein , J. 1993 . Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming . Mathematics of Operations Research , 18 : 202 – 226 .
   Web of Science ®Google Scholar
• Eggermong , P.B. 1990 . Multiplicative iterative algorithms for convex programming . Linear Algebra and its Applications , 130 : 25 – 32 .
   Web of Science ®Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Iusem A. N. Steepest descent methods with generalized distances for constrained optimization Acta Applicandae Mathematicae 1994 accepted for publication
   Google Scholar
• 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 .
   Web of Science ®Google Scholar
• Lemarie , B. 1989 . “ The proximal algorithm ” . In International Series of Numerical Mathematics , Edited by: Penot , J.P. 73 – 87 . Basel : Birkhauser .
   Google Scholar
• Mangasarian , O.L. 1969 . Nonlinear Programming , New York : McGraw-Hill .
   Google Scholar
• Polyak , B.T. 1987 . Introduction to Optimization , New York : Optimization Software. Inc., Publications Division .
   Google Scholar
• Rockafellar , R.T. 1976 . Monotone operators and the proximal point algorithm . SIAM Journal on Control and Optimization , 14 ( 5 ) : 877 – 898 .
   Web of Science ®Google Scholar
• Solodov , M.V. and Tseng , P. 1996 . Modified projeciton–type methods for monotone variational inequalilics . SIAM Journal on Control and Optimization , 34 ( 5 ) : 1814 – 1830 .
   Web of Science ®Google Scholar