Estimates of the Duality Gap in Nonconvex Optimization

DOI10.1287/moor.1.3.225zbMath0366.90102OpenAlexW2000354435WikidataQ55920762 ScholiaQ55920762MaRDI QIDQ4143030

Ivar Ekeland, Jean-Pierre Aubin

Publication date: 1976

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1.3.225

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (27)

Bounding duality gap for separable problems with linear constraints ⋮ Some characterizations of φ-Lagrangian dual problems ⋮ Private information, transferable utility, and the core ⋮ Approximation Bounds for Sparse Programs ⋮ Lagrange duality and partitioning techniques in nonconvex global optimization ⋮ Duality in nonlinear programming ⋮ Existence of optimal Lagrange multipliers for certain nonconvex allocation problems ⋮ Large-Scale Nonconvex Optimization: Randomization, Gap Estimation, and Numerical Resolution ⋮ Duality Gap Estimation via a Refined Shapley--Folkman Lemma ⋮ A note on the duality gap in nonconvex optimization and a very simple procedure for bid evaluation type problems ⋮ Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization ⋮ Quantitative measure of nonconvexity for black-box continuous functions ⋮ Unnamed Item ⋮ A Stackelberg game approach to distributed spectrum management ⋮ A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees ⋮ Two new reformulation convexification based hierarchies for 0-1 MIPs ⋮ Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization ⋮ A generalized duality and applications ⋮ Duality gaps in nonconvex stochastic optimization ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ Extended duality for nonlinear programming ⋮ On parametric nonlinear programming ⋮ Uniform approximation by classes of functions closed under translation and pointwise supremum ⋮ Théorems d'existence pour des problèmes du calcul des variations du type: Inf \(\int^L_0 f(x,u'(x))dx\) et Inf \(\int^L_0 f(x,u(x),u'(x))dx\) ⋮ A feasibility-ensured Lagrangian heuristic for general decomposable problems ⋮ The not-quite non-atomic game: non-emptiness of the core in large production games ⋮ A decomposition method for large scale MILPs, with performance guarantees and a power system application

This page was built for publication: Estimates of the Duality Gap in Nonconvex Optimization