Strong formulations for conic quadratic optimization with indicator variables
From MaRDI portal
Publication:2039236
DOI10.1007/s10107-020-01508-yzbMath1470.90056OpenAlexW3021266223MaRDI QIDQ2039236
Publication date: 2 July 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01508-y
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items (5)
\(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ A computational study of perspective cuts ⋮ A note on the implications of approximate submodularity in discrete optimization ⋮ Supermodularity and valid inequalities for quadratic optimization with indicators ⋮ A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Approximated perspective relaxations: a project and lift approach
- Mixed integer second-order cone programming formulations for variable selection in linear regression
- Mixed-integer nonlinear programs featuring ``on/off constraints
- Lifting for conic mixed-integer programming
- 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
- Conic mixed-integer rounding cuts
- Two-term disjunctions on the second-order cone
- Polymatroids and mean-risk minimization in discrete optimization
- Robust solutions of uncertain linear programs
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Improving the approximated projected perspective reformulation by dual information
- Quadratic cone cutting surfaces for quadratic programs with on-off constraints
- Some cut-generating functions for second-order conic sets
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Disjunctive cuts for cross-sections of the second-order cone
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- On mathematical programming with indicator constraints
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Cuts for mixed 0-1 conic programming
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Robust Convex Optimization
- On Minimal Valid Inequalities for Mixed Integer Conic Programs
- A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
- Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
- Introduction to Stochastic Programming
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- 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
- Capacitated warehouse location model with risk pooling
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- Robust Solutions to Least-Squares Problems with Uncertain Data
- A Strong Dual for Conic Mixed-Integer Programs
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Scalable Algorithms for the Sparse Ridge Regression
- Maximizing a Class of Utility Functions Over the Vertices of a Polytope
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
This page was built for publication: Strong formulations for conic quadratic optimization with indicator variables
