Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and D.C. Optimization problems
- 1 May 1988
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 41 (1) , 161-183
- https://doi.org/10.1007/bf01580762
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimizationJournal of Optimization Theory and Applications, 1986
- The cubic algorithmJournal of Mathematical Analysis and Applications, 1985
- On the global minimization of concave functionsOR Spectrum, 1984
- 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
- Linear programs with an additional reverse convex constraintApplied Mathematics & Optimization, 1980
- Reverse convex programmingApplied Mathematics & Optimization, 1980
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- An Algorithm for Separable Nonconvex Programming ProblemsManagement Science, 1969