A graph-based decomposition method for convex quadratic optimization with indicators
From MaRDI portal
Publication:6102761
DOI10.1007/s10107-022-01845-0zbMath1519.90149arXiv2110.12547OpenAlexW3209899906MaRDI QIDQ6102761
Salar Fattahi, Andrés Gómez, Peijing Liu, Simge Küçükyavuz
Publication date: 23 June 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.12547
decompositionquadratic optimizationconvex hullgraphical modelssparsityFenchel dualindicator variables
Related Items (3)
\(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ On the convex hull of convex quadratic optimization problems with indicators ⋮ Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Primal-dual subgradient methods for convex problems
- Best subset selection via a modern optimization lens
- On general minimax theorems
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Bayesian image restoration, with two applications in spatial statistics (with discussion)
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Improving the approximated projected perspective reformulation by dual information
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Computational study of a family of mixed-integer quadratic programming problems
- Convex programming for disjunctive convex optimization
- Outer approximation for integer nonlinear programs via decision diagrams
- Quadratic optimization with switching variables: the convex hull for \(n=2\)
- Sparse regression at scale: branch-and-bound rooted in first-order optimization
- Ideal formulations for constrained convex optimization problems with indicator variables
- Blessing of massive scale: spatial graphical model estimation with a total cardinality constraint approach
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- Formulations for dynamic lot sizing with service levels
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Spatio-Temporal Signal Recovery Based on Low Rank and Differential Smoothness
- Subset Selection in Sparse Matrices
- Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
- Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs
- On the Consistent Path Problem
- Scalable Algorithms for the Sparse Ridge Regression
- An efficient algorithm for image segmentation, Markov random fields and related problems
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: A graph-based decomposition method for convex quadratic optimization with indicators
