On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- 1 March 1998
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 81 (1), 23-35
- https://doi.org/10.1007/bf01584842
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Error Stability Properties of Generalized Gradient-Type AlgorithmsJournal of Optimization Theory and Applications, 1998
- Convergence of the steepest descent method for minimizing quasiconvex functionsJournal of Optimization Theory and Applications, 1996
- Full convergence of the steepest descent method with inexact line searchesOptimization, 1995
- Entropy-Like Proximal Methods in Convex ProgrammingMathematics of Operations Research, 1994
- Convergence of some algorithms for convex minimizationMathematical Programming, 1993
- The stabilizing properties of the gradient methodUSSR Computational Mathematics and Mathematical Physics, 1986
- On the method of generalized stochastic gradients and quasi-Féjer sequencesCybernetics and Systems Analysis, 1972
- Local boundedness of nonlinear, monotone operators.The Michigan Mathematical Journal, 1969
- Methods of solution of nonlinear extremal problemsCybernetics and Systems Analysis, 1968
- On the subdifferentiability of convex functionsProceedings of the American Mathematical Society, 1965