Bounding duality gap for separable problems with linear constraints
From MaRDI portal
Publication:288396
Abstract: We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which each function in the objective is replaced by its convex envelope. We propose a randomized algorithm to solve the convexified problem which finds an -suboptimal solution to the original problem. With probability one, is bounded by a term proportional to the maximal number of active constraints in the problem. The bound does not depend on the number of variables in the problem or the number of terms in the objective. In contrast to previous related work, our proof is constructive, self-contained, and gives a bound that is tight.
Recommendations
- Convex separable minimization problems with a linear constraint and bounded variables
- Convex separable minimization subject to bounded variables
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- A class of problems where dual bounds beat underestimation bounds
- Minimization of a strictly convex separable function subject to a convex inequality constraint or linear equality constraints and bounds on the variables
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3772867 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1860211 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 3327459 (Why is no real title available?)
- A Distributed Approach for the Optimal Power-Flow Problem Based on ADMM and Sequential Convex Approximations
- A convex envelope formula for multilinear functions
- A decomposition method for large scale MILPs, with performance guarantees and a power system application
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A geometric study of dual gaps, with applications
- A proximal-based deomposition method for compositions method for convex minimization problems
- An extension of the simplex algorithm for semi-infinite linear programming
- Application of the alternating direction method of multipliers to separable convex programming problems
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- Convex Analysis
- Convex functions. Constructions, characterizations and counterexamples
- Convex optimization theory.
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Estimates of the Duality Gap in Nonconvex Optimization
- Generic optimality conditions for semialgebraic convex programs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Introduction to global optimization.
- Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
- On alternating direction methods of multipliers: a historical perspective
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
- Optimal short-term scheduling of large-scale power systems
- Problems of distance geometry and convex properties of quadratic maps
- Quasi-Equilibria in Markets with Non-Convex Preferences
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Techniques for exploring the suboptimal set
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- The convex envelope is the solution of a nonlinear obstacle problem
- What is the Subdifferential of the Closed Convex Hull of a Function?
Cited in
(10)- A characterization of Delsarte's linear programming bound as a ratio bound
- Duality gap estimation via a refined Shapley-Folkman lemma
- Vanishing price of decentralization in large coordinative nonconvex optimization
- Tax-aware portfolio construction via convex optimization
- Approximation Bounds for Sparse Programs
- Separating tight metric inequalities by bilevel programming
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Duality gap in interval linear programming
- Stable Bounds on the Duality Gap of Separable Nonconvex Optimization Problems
- A decentralized approach to multi-agent MILPs: finite-time feasibility and performance guarantees
This page was built for publication: Bounding duality gap for separable problems with linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q288396)
