Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems

DOI10.1007/BF01580762zbMath0651.90063OpenAlexW1986778884MaRDI QIDQ1106728

Hoang Tuy, Reiner Horst

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580762

zbMATH Keywords

global optimizationconcave minimizationbranch-and-boundouter approximationdifference of two convex functionsd.c. optimization.grid-search techniquesrestart procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

Variations and extension of the convex-concave procedure, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities, On solving general reverse convex programming problems by a sequence of linear programs and line searches, New LP bound in multivariate Lipschitz optimization: Theory and applications, On the global minimization of a convex function under general nonconvex constraints, Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients, Decomposition approach for the global minimization of biconcave functions over polytopes, Canonical DC programming problem: Outer approximation methods revisited, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, A branch-and-reduce approach to global optimization, The theoretical and empirical rate of convergence for geometric branch-and-bound methods, A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities, Convex Maximization via Adjustable Robust Optimization, A modified proximal point method for DC functions on Hadamard manifolds, On the exhaustivity of simplicial partitioning, A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization, Normal conical algorithm for concave minimization over polytopes, Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms, Optimization methods for mixed integer weakly concave programming problems, Mathematical programs with a two-dimensional reverse convex constraint, On solving a d.c. programming problem by a sequence of linear programs, A new simplicial cover technique in constrained global optimization, DC decomposition of nonconvex polynomials with algebraic techniques, GBSSS: The generalized big square small square method for planar single- facility location, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables, Calculation of bounds on variables satisfying nonlinear inequality constraints, Branch and Win: OR tree search algorithms for solving combinatorial optimisation problems., Outer approximation algorithms for canonical DC problems, A note on adapting methods for continuous global optimization to the discrete case, Separable concave minimization via partial outer approximation and branch and bound, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, Hybrid approach for solving multiple-objective linear programs in outcome space, Certified efficient global roundness evaluation, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, On the topological complexity of DC-sets, Methods for solving multi-extremal problems (global search)

Cites Work

• Unnamed Item
• Unnamed Item
• On the global minimization of concave functions
• An outer approximation method for globally minimizing a concave function over a compact convex set
• On outer approximation methods for solving concave minimization problems
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• Convex programs with an additional reverse convex constraint
• The cubic algorithm
• On the convergence of global methods in multiextremal optimization
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
• Constrained global optimization: algorithms and applications
• Linear programs with an additional reverse convex constraint
• Reverse convex programming
• Outer approximation algorithm for nondifferentiable optimization problems
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• Globally convergent methods for n-dimensional multiextremal optimization
• Global optimization under Lipschitzian constraints
• A note on the convergence of an algorithm for nonconvex programming problems
• A method for globally minimizing concave functions over convex sets
• Convergent Algorithms for Minimizing a Concave Function
• An algorithm for nonconvex programming problems
• A Successive Underestimation Method for Concave Minimization Problems
• An Algorithm for Separable Nonconvex Programming Problems
• Convex Analysis