On Minimal Valid Inequalities for Mixed Integer Conic Programs
From MaRDI portal
Publication:2806815
DOI10.1287/moor.2015.0737zbMath1338.90275arXiv1408.6922OpenAlexW1877367452MaRDI QIDQ2806815
Publication date: 19 May 2016
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.6922
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Related Items
Convex hull of two quadratic or a conic quadratic and a quadratic inequality, Maximal Quadratic-Free Sets, On sublinear inequalities for mixed integer conic programs, Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, The structure of the infinite models in integer programming, Disjunctive cuts in mixed-integer conic optimization, Two-term disjunctions on the second-order cone, Outer-product-free sets for polynomial optimization and oracle-based cuts, Submodularity in Conic Quadratic Mixed 0–1 Optimization, Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs, How to convexify the intersection of a second order cone and a nonconvex quadratic, Quadratic cone cutting surfaces for quadratic programs with on-off constraints, Some cut-generating functions for second-order conic sets, Mixed integer programming with a class of nonlinear convex constraints, Intersection cuts for convex mixed integer programs from translated cones, Split cuts and extended formulations for mixed integer conic quadratic programming, Strong formulations for conic quadratic optimization with indicator variables, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, Cut-Generating Functions for Integer Variables, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, Maximal quadratic-free sets
Uses Software
Cites Work
- Unnamed Item
- Sufficiency of cut-generating functions
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15--17, 2011. Proceedings
- Lifting for conic mixed-integer programming
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Conic mixed-integer rounding cuts
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- An algorithmic framework for convex mixed integer nonlinear programs
- Equivalence between intersection cuts and the corner polyhedron
- Valid inequalities for mixed integer linear programs
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Semidefinite programming in combinatorial optimization
- Disjunctive cuts for cross-sections of the second-order cone
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A branch-and-cut method for 0-1 mixed convex programming
- The split closure of a strictly convex body
- Sparse learning via Boolean relaxations
- Clustering via minimum volume ellipsoids
- On the facets of mixed integer programs with two integer variables and two constraints
- Portfolio optimization with linear and fixed transaction costs
- Some polyhedra related to combinatorial problems
- Cuts for mixed 0-1 conic programming
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- Cut-Generating Functions for Integer Variables
- Cutting-planes for weakly-coupled 0/1 second order cone programs
- The MILP Road to MIQCP
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
- Convex Sets and Minimal Sublinear Functions
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- Convexification Techniques for Linear Complementarity Constraints
- An LMI description for the cone of Lorentz-positive maps II
- Minimal Valid Inequalities for Integer Constraints
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Minimal inequalities
- Disjunctive Programming
- A Strong Dual for Conic Mixed-Integer Programs
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Cut-Generating Functions and S-Free Sets
- Cardinality Constrained Linear-Quadratic Optimal Control
- Two-Term Disjunctions on the Second-Order Cone
- Mixed-integer nonlinear optimization
- An LMI description for the cone of Lorentz-positive maps
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Integer programming and convex analysis: Intersection cuts from outer polars
