An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
- 1 July 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 27 (4) , 737-757
- https://doi.org/10.1137/0327039
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Methods of Descent for Nondifferentiable OptimizationLecture Notes in Mathematics, 1985
- Variable metric relaxation methods, part II: The ellipsoid methodMathematical Programming, 1984
- A class of rank-two ellipsoid algorithms for convex programmingMathematical Programming, 1984
- An ellipsoid algorithm for nonlinear programmingMathematical Programming, 1983
- Convergence Rates of the Ellipsoid Method on General Convex FunctionsMathematics of Operations Research, 1983
- Modifications and implementation of the ellipsoid algorithm for linear programmingMathematical Programming, 1982
- Feature Article—The Ellipsoid Method: A SurveyOperations Research, 1981
- Combined lp and quasi-Newton methods for minimax optimizationMathematical Programming, 1981
- Methods for modifying matrix factorizationsMathematics of Computation, 1974
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960