Mirror descent and nonlinear projected subgradient methods for convex optimization
Top Cited Papers
- 1 May 2003
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 31 (3) , 167-175
- https://doi.org/10.1016/s0167-6377(02)00231-6
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Incremental Subgradient Methods for Nondifferentiable OptimizationSIAM Journal on Optimization, 2001
- The Ordered Subsets Mirror Descent Optimization Method with Applications to TomographySIAM Journal on Optimization, 2001
- An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite ProgrammingSIAM Journal on Optimization, 1998
- Proximal Minimization Methods with Generalized Bregman FunctionsSIAM Journal on Control and Optimization, 1997
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman FunctionsSIAM Journal on Optimization, 1993
- Entropic Proximal Mappings with Applications to Nonlinear ProgrammingMathematics of Operations Research, 1992
- 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
- On the Optimum Rate of Transmitting InformationThe Annals of Mathematical Statistics, 1969
- 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