Two-term disjunctions on the second-order cone
From MaRDI portal
Publication:896297
DOI10.1007/s10107-015-0903-4zbMath1327.90137arXiv1404.7813OpenAlexW2176736031MaRDI QIDQ896297
Sercan Yıldız, Fatma Kılınç-Karzan
Publication date: 9 December 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.7813
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (21)
Convex hull of two quadratic or a conic quadratic and a quadratic inequality ⋮ Maximal Quadratic-Free Sets ⋮ On Convex Hulls of Epigraphs of QCQPs ⋮ On the tightness of SDP relaxations of QCQPs ⋮ 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 ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ Disjunctive cuts in mixed-integer conic optimization ⋮ Lifted polymatroid inequalities for mean-risk optimization with indicator variables ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ A new framework to relax composite functions in nonlinear programs ⋮ How to convexify the intersection of a second order cone and a nonconvex quadratic ⋮ 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 ⋮ Disjunctive cuts for cross-sections of the second-order cone ⋮ Strong formulations for conic quadratic optimization with indicator variables ⋮ A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming ⋮ Optimization hierarchy for fair statistical decision problems ⋮ The generalized trust region subproblem: solution complexity and convex hull results ⋮ Maximal quadratic-free sets
Cites Work
- Unnamed Item
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Lifting for conic mixed-integer programming
- Conic mixed-integer rounding cuts
- Computing deep facet-defining disjunctive cuts for mixed-integer programming
- A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
- Optimization with disjunctive constraints
- Disjunctive programming: Properties of the convex hull of feasible points
- Lift-and-project cuts for convex mixed integer nonlinear programs
- 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
- The split closure of a strictly convex body
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- Cutting planes from two-term disjunctions
- A convex-analysis perspective on disjunctive cuts
- Cuts for mixed 0-1 conic programming
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- On Minimal Valid Inequalities for Mixed Integer Conic Programs
- Cutting-planes for weakly-coupled 0/1 second order cone programs
- Disjunctive Cuts for Nonconvex MINLP
- The MILP Road to MIQCP
- 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
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Disjunctive Programming
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Two-Term Disjunctions on the Second-Order Cone
- Convex Analysis
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
This page was built for publication: Two-term disjunctions on the second-order cone
