Bounding duality gap for separable problems with linear constraints
From MaRDI portal
Publication:288396
DOI10.1007/s10589-015-9819-4zbMath1351.90135arXiv1410.4158OpenAlexW2297878663WikidataQ59831367 ScholiaQ59831367MaRDI QIDQ288396
Madeleine Udell, Stephen P. Boyd
Publication date: 25 May 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.4158
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Approximation Bounds for Sparse Programs, Dual decomposition for multi-agent distributed optimization with coupling constraints, Duality Gap Estimation via a Refined Shapley--Folkman Lemma, Vanishing Price of Decentralization in Large Coordinative Nonconvex Optimization, A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees, Tax-aware portfolio construction via convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- Techniques for exploring the suboptimal set
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A proximal-based deomposition method for compositions method for convex minimization problems
- Problems of distance geometry and convex properties of quadratic maps
- A convex envelope formula for multilinear functions
- An extension of the simplex algorithm for semi-infinite linear programming
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Generic Optimality Conditions for Semialgebraic Convex Programs
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- The convex envelope is the solution of a nonlinear obstacle problem
- COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION
- Optimal short-term scheduling of large-scale power systems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Estimates of the Duality Gap in Nonconvex Optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
- Cone-LP's and semidefinite programs: Geometry and a simplex-type method
- What is the Subdifferential of the Closed Convex Hull of a Function?
- On Alternating Direction Methods of Multipliers: A Historical Perspective
- A Distributed Approach for the Optimal Power-Flow Problem Based on ADMM and Sequential Convex Approximations
- Quasi-Equilibria in Markets with Non-Convex Preferences
- Convex Analysis
- Introduction to global optimization.
- A geometric study of dual gaps, with applications
