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

DOI10.1007/s10898-011-9748-4zbMath1244.90184OpenAlexW1986472569MaRDI QIDQ427376

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)

Cites Work

• Unnamed Item
• Unnamed Item
• A class of problems where dual bounds beat underestimation bounds
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Exhaustive Nondegenerate Conical Processes for Concave Minimization on Convex Polytopes
• 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
• 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