A descent algorithm for nonsmooth convex optimization
- 1 October 1984
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 30 (2) , 163-175
- https://doi.org/10.1007/bf02591883
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functionsMathematical Programming, 1982
- A bundle type approach to the unconstrained minimization of convex nonsmooth functionsMathematical Programming, 1982
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimizationPublished by Springer Nature ,1982
- ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATIONPublished by Elsevier ,1981
- An Algorithm for Constrained Optimization with Semismooth FunctionsMathematics of Operations Research, 1977
- 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
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost FunctionalsSIAM Journal on Control, 1973
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963