Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
- 1 December 1982
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 24 (1) , 241-256
- https://doi.org/10.1007/bf01585109
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex FunctionsMathematics of Operations Research, 1983
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimizationPublished by Springer Nature ,1982
- Steplength algorithms for minimizing a class of nondifferentiable functionsComputing, 1979
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959