On duality bound methods for nonconvex global optimization
From MaRDI portal
Publication:995944
DOI10.1007/S10898-006-9055-7zbMATH Open1138.90021OpenAlexW1983734213MaRDI QIDQ995944FDOQ995944
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
Cites Work
- On a decomposition method for nonconvex global optimization
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Duality Bound Methods in Global Optimization
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
- Convergence of duality bound method in partly convex programming
Cited In (8)
- On local search in d.c. optimization problems
- Lagrange duality and partitioning techniques in nonconvex global optimization
- Duality gaps in nonconvex stochastic optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dual coordinate ascent methods for non-strictly convex minimization
- Run-and-inspect method for nonconvex optimization and global optimality bounds for R-local minimizers
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)
