Convergence of duality bound method in partly convex programming
From MaRDI portal
Publication:598600
DOI10.1023/A:1013871532570zbMath1045.90047MaRDI QIDQ598600
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
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 a decomposition method for nonconvex global optimization ⋮ On solving nonconvex optimization problems by reducing the duality gap ⋮ On duality bound methods for nonconvex global optimization
This page was built for publication: Convergence of duality bound method in partly convex programming
