Concave minimization via conical partitions and polyhedral outer approximation
- 1 March 1991
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 50 (1-3) , 259-274
- https://doi.org/10.1007/bf01594938
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Deterministic methods in constrained global optimization: Some recent advances and new fields of applicationNaval Research Logistics (NRL), 1990
- On consistency of bounding operations in deterministic global optimizationJournal of Optimization Theory and Applications, 1989
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalitiesJournal of Optimization Theory and Applications, 1988
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimizationJournal of Optimization Theory and Applications, 1988
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimizationJournal of Optimization Theory and Applications, 1986
- On the global minimization of concave functionsOR Spectrum, 1984
- On the convergence of two branch-and-bound algorithms for nonconvex programming problemsJournal of Optimization Theory and Applications, 1982
- A method for globally minimizing concave functions over convex setsMathematical Programming, 1981
- A note on the convergence of an algorithm for nonconvex programming problemsMathematical Programming, 1980
- An algorithm for nonconvex programming problemsMathematical Programming, 1976