Duality Bound Methods in Global Optimization

DOI10.1007/0-387-25570-2_3MaRDI QIDQ5421800zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• On a decomposition method for nonconvex global optimization
• Global optimization for non-convex quadratic programs with additional multiplicative constraints
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
• On solving nonconvex optimization problems by reducing the duality gap

Cited in

(5)

• An analytical approach to global optimization
• On a decomposition method for nonconvex global optimization
• Local statements on dual methods in problems of multilevel optimization
• On the relation between concavity cuts and the surrogate dual for convex maximization problems
• On duality bound methods for nonconvex global optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5421800)