On the relation between concavity cuts and the surrogate dual for convex maximization problems

DOI10.1007/S10898-011-9748-4MaRDI QIDQ427376zbMATH OpenOpenAlexFDO

Authors Marco Locatelli, Fabio Schoen

Publication date 13 June 2012

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

Full work available at URL https://doi.org/10.1007/s10898-011-9748-4

zbMATH Keywords

concavity cutconvex maximizationsurrogate dual

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• scientific article; zbMATH DE number 3909181
• scientific article; zbMATH DE number 4005983
• Conjugate duality for concave maximization problems and applications
• A new algorithm for concave quadratic programming
• scientific article; zbMATH DE number 3910160

Cites work

• A class of problems where dual bounds beat underestimation bounds
• Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
• Convergent Algorithms for Minimizing a Concave Function
• Duality Bound Methods in Global Optimization
• Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Lagrange Multipliers and Nonconvex Programs

This page was built for publication: On the relation between concavity cuts and the surrogate dual for convex maximization problems

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