Duality Gap Estimation via a Refined Shapley--Folkman Lemma

DOI10.1137/18M1174805zbMath1452.90249WikidataQ124956242 ScholiaQ124956242MaRDI QIDQ5107209

Ao Tang, Yingjie Bi

Publication date: 17 April 2020

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

duality gapnonconvex optimizationconvex relaxationnetwork resource allocation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Bounding duality gap for separable problems with linear constraints
• Carathéodory-type results for the sums and unions of convex sets
• A k-extreme point is the limit of k-exposed points
• Estimates of the Duality Gap in Nonconvex Optimization
• Duality Gap Estimation and Polynomial Time Approximation for Optimal Spectrum Management
• Quasi-Equilibria in Markets with Non-Convex Preferences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Duality Gap Estimation via a Refined Shapley--Folkman Lemma