On duality bound methods for nonconvex global optimization

DOI10.1007/S10898-006-9055-7MaRDI QIDQ995944zbMATHOpenAlexFDO

Authors Hoang Tuy

Publication date 10 September 2007

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-006-9055-7

zbMATH Keywords

Duality bound methodsNonconvex global optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites work

• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
• Convergence of duality bound method in partly convex programming
• Duality Bound Methods in Global Optimization
• Duality bound method for the general quadratic programming problem with quadratic constraints
• On a decomposition method for nonconvex global optimization

Cited in

(8)

• On local search in d.c. optimization problems
• scientific article; zbMATH DE number 5778001 (Why is no real title available?)
• Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers
• scientific article; zbMATH DE number 3887457 (Why is no real title available?)
• Dual coordinate ascent methods for non-strictly convex minimization
• Lagrange duality and partitioning techniques in nonconvex global optimization
• scientific article; zbMATH DE number 6667271 (Why is no real title available?)
• Duality gaps in nonconvex stochastic optimization

This page was built for publication: On duality bound methods for nonconvex global optimization

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