Dual bounding procedures lead to convergent branch-and-bound algorithms

DOI10.1007/S101070100236zbMath1001.90053OpenAlexW162069171MaRDI QIDQ5955564

Mirjam Dür

Publication date: 27 May 2002

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

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

zbMATH Keywords

nonconvex dualityconvergence of branch-and-bound algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Duality theory (optimization) (49N15)

Related Items (9)

Convergence-order analysis of branch-and-bound algorithms for constrained problems ⋮ Global optimization of disjunctive programs ⋮ A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization ⋮ On a decomposition method for nonconvex global optimization ⋮ Lagrangian decomposition of block-separable mixed-integer all-quadratic programs ⋮ Probabilistic subproblem selection in branch-and-bound algorithms ⋮ Convergent upper bounds in global minimization with nonlinear equality constraints ⋮ A branch-and-bound algorithm for nonconvex Nash equilibrium problems ⋮ Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints

This page was built for publication: Dual bounding procedures lead to convergent branch-and-bound algorithms