On the convexification of constrained quadratic optimization problems with indicator variables
From MaRDI portal
Recommendations
- Ideal formulations for constrained convex optimization problems with indicator variables
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- A graph-based decomposition method for convex quadratic optimization with indicators
- Strong formulations for conic quadratic optimization with indicator variables
- Strong formulations for quadratic optimization with M-matrices and indicator variables
Cites work
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- A lasso for hierarchical interactions
- A selective review of group selection in high-dimensional models
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A unified approach to mixed-integer optimization problems with logical constraints
- Approximated perspective relaxations: a project and lift approach
- Best subset selection via a modern optimization lens
- Convex programming for disjunctive convex optimization
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Decompositions of semidefinite matrices and the perspective reformulation of nonseparable quadratic programs
- Fast best subset selection: coordinate descent and local combinatorial optimization algorithms
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Improving the performance of MIQP solvers for quadratic programs with cardinality and minimum threshold constraints: a semidefinite program approach
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Least angle regression. (With discussion)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Nearly unbiased variable selection under minimax concave penalty
- On convex relaxations for quadratically constrained quadratic programming
- On integer and MPCC representability of affine sparsity
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the tightness of SDP relaxations of QCQPs
- On valid inequalities for quadratic programming with continuous variables and binary indicators
- OR forum: An algorithmic approach to linear regression
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Projected perspective reformulations with applications in design problems
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Quadratic convex reformulations for semicontinuous quadratic programming
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
- Sparse Approximate Solutions to Linear Systems
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Structural properties of affine sparsity constraints
- The generalized trust region subproblem: solution complexity and convex hull results
- Two-term disjunctions on the second-order cone
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(15)- Valid inequalities for separable concave constraints with indicator variables
- Ideal formulations for constrained convex optimization problems with indicator variables
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- Approximation Bounds for Sparse Programs
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- 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
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- Constrained optimization of rank-one functions with indicator variables
- Integer programming for learning directed acyclic graphs from nonidentifiable Gaussian models
- A parametric approach for solving convex quadratic optimization with indicators over trees
- Polyhedral analysis of quadratic optimization problems with Stieltjes matrices and indicators
This page was built for publication: On the convexification of constrained quadratic optimization problems with indicator variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041763)
