Ideal formulations for constrained convex optimization problems with indicator variables
From MaRDI portal
Publication:2118117
DOI10.1007/s10107-021-01734-yzbMath1489.90071arXiv2007.00107OpenAlexW3215881363MaRDI QIDQ2118117
Andrés Gómez, Linchuan Wei, Simge Küçükyavuz
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.00107
Related Items (5)
A new perspective on low-rank optimization ⋮ A graph-based decomposition method for convex quadratic optimization with indicators ⋮ On the convex hull of convex quadratic optimization problems with indicators ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ Subset Selection and the Cone of Factor-Width-k Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Approximated perspective relaxations: a project and lift approach
- Best subset selection via a modern optimization lens
- Feature subset selection for logistic regression via mixed integer optimization
- A lasso for hierarchical interactions
- Mixed-integer nonlinear programs featuring ``on/off constraints
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Least angle regression. (With discussion)
- On convex relaxations for quadratically constrained quadratic programming
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Sparse regression: scalable algorithms and empirical performance
- On integer and MPCC representability of affine sparsity
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Sparse learning via Boolean relaxations
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Structural properties of affine sparsity constraints
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- OR Forum—An Algorithmic Approach to Linear Regression
- Projected Perspective Reformulations with Applications in Design Problems
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Sparse Approximate Solutions to Linear Systems
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
- On Convex Hulls of Epigraphs of QCQPs
- On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
- Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs
- Scalable Algorithms for the Sparse Ridge Regression
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
- Forbidden Vertices
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming
- Two-Term Disjunctions on the Second-Order Cone
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- A selective review of group selection in high-dimensional models
This page was built for publication: Ideal formulations for constrained convex optimization problems with indicator variables
