Duality Bound Methods in Global Optimization

DOI10.1007/0-387-25570-2_3zbMath1133.90378OpenAlexW43134887MaRDI QIDQ5421800

Nguyen Van Thoai, Reiner Horst

Publication date: 24 October 2007

Published in: Essays and Surveys in Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/0-387-25570-2_3

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (3)

On the relation between concavity cuts and the surrogate dual for convex maximization problems ⋮ On a decomposition method for nonconvex global optimization ⋮ On duality bound methods for nonconvex global optimization

This page was built for publication: Duality Bound Methods in Global Optimization