Proximal Minimization Methods with Generalized Bregman Functions
- 1 July 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 35 (4) , 1142-1168
- https://doi.org/10.1137/s0363012995281742
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple boundsMathematics of Computation, 1997
- Partial Proximal Minimization Algorithms for Convex PprogrammingSIAM Journal on Optimization, 1994
- Weak Sharp Minima in Mathematical ProgrammingSIAM Journal on Control and Optimization, 1993
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman FunctionsSIAM Journal on Optimization, 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
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified ApproachSIAM Journal on Control and Optimization, 1990
- Numerical methods for nondifferentiable convex optimizationPublished by Springer Nature ,1987
- An iterative row-action method for interval convex programmingJournal of Optimization Theory and Applications, 1981
- Monotone Operators and the Proximal Point AlgorithmSIAM Journal on Control and Optimization, 1976