Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- 1 August 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 3 (3) , 538-543
- https://doi.org/10.1137/0803026
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex ProgrammingMathematics of Operations Research, 1993
- Proximal minimization algorithm withD-functionsJournal of Optimization Theory and Applications, 1992
- On the Convergence of the Proximal Point Algorithm for Convex MinimizationSIAM Journal on Control and Optimization, 1991
- Multiplicative iterative algorithms for convex programmingLinear Algebra and its Applications, 1990
- A relaxed version of Bregman's method for convex programmingJournal of Optimization Theory and Applications, 1986
- An iterative row-action method for interval convex programmingJournal of Optimization Theory and Applications, 1981
- Produits infinis de resolvantesIsrael Journal of Mathematics, 1978
- Perturbation des méthodes d'optimisation. ApplicationsRAIRO. Analyse numérique, 1978
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967
- Proximité et dualité dans un espace hilbertienBulletin de la Société Mathématiques de France, 1965