Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization
- 1 July 1988
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 58 (1) , 11-37
- https://doi.org/10.1007/bf00939768
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex SetMathematics of Operations Research, 1985
- A finite algorithm for concave minimization over a polyhedronNaval Research Logistics Quarterly, 1985
- Jointly Constrained Biconvex ProgrammingMathematics of Operations Research, 1983
- Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible DomainMathematics of Operations Research, 1983
- On the convergence of two branch-and-bound algorithms for nonconvex programming problemsJournal of Optimization Theory and Applications, 1982
- A note on the convergence of an algorithm for nonconvex programming problemsMathematical Programming, 1980
- Convergent Algorithms for Minimizing a Concave FunctionMathematics of Operations Research, 1980
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- An Algorithm for Separable Nonconvex Programming ProblemsManagement Science, 1969