Normal conical algorithm for concave minimization over polytopes
- 1 July 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 51 (1) , 229-245
- https://doi.org/10.1007/bf01586935
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex PolytopesMathematics of Operations Research, 1988
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problemsMathematical Programming, 1988
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmizationOptimization, 1987
- Methods for Global Concave Minimization: A Bibliographic SurveySIAM Review, 1986
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex SetMathematics of Operations Research, 1985
- On the global minimization of concave functionsOR Spectrum, 1984
- Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraintsApplied Mathematics & Optimization, 1981
- Convergent Algorithms for Minimizing a Concave FunctionMathematics of Operations Research, 1980
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- Nonlinear Programming: Counterexamples to Two Global Optimization AlgorithmsOperations Research, 1973