On convergence rates of subgradient optimization methods
- 1 December 1977
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 13 (1) , 329-347
- https://doi.org/10.1007/bf01584346
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A method of conjugate subgradients for minimizing nondifferentiable functionsPublished by Springer Nature ,1975
- An extension of davidon methods to non differentiable problemsPublished by Springer Nature ,1975
- Note on a method of conjugate subgradients for minimizing nondifferentiable functionsMathematical Programming, 1974
- An iterative method, having linear rate of convergence, for solving a pair of dual linear programsMathematical Programming, 1972
- The rate of convergence of the generalized gradient descent methodCybernetics and Systems Analysis, 1972
- Algorithms for the solution of the two-stage problem in stochastic programmingCybernetics and Systems Analysis, 1972
- Minimization of Functionals in Normed SpacesSIAM Journal on Control, 1968
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954