Outer approximation by polyhedral convex sets
Authors:
- 1 September 1987
- journal article
- Published by Springer Nature in OR Spectrum
- Vol. 9 (3) , 153-159
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the convergence of a class of outer approximation algorithms for convex programsJournal of Computational and Applied Mathematics, 1984
- Outer approximation algorithm for nondifferentiable optimization problemsJournal of Optimization Theory and Applications, 1984
- An Outer Approximation Algorithm for Solving General Convex ProgramsOperations Research, 1983
- A method for globally minimizing concave functions over convex setsMathematical Programming, 1981
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- Applications of a general convergence theory for outer approximation algorithmsMathematical Programming, 1973
- Generalized Cutting Plane AlgorithmsSIAM Journal on Control, 1971
- Constrained minimization methodsUSSR Computational Mathematics and Mathematical Physics, 1966
- 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