How to convexify the intersection of a second order cone and a nonconvex quadratic
From MaRDI portal
Publication:517311
DOI10.1007/S10107-016-1045-ZzbMath1358.90095arXiv1406.1031OpenAlexW2160186678MaRDI QIDQ517311
Samuel Burer, Fatma Kılınç-Karzan
Publication date: 23 March 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.1031
nonconvex quadratic programmingconvex hulldisjunctive programmingmixed-integer linear programmingmixed-integer nonlinear programmingmixed-integer quadratic programmingtrust-region subproblemsecond-order-cone programming
Convex programming (90C25) Integer programming (90C10) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (26)
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 Convexification of Constrained Quadratic Optimization Problems with Indicator Variables ⋮ On the tightness of SDP relaxations of QCQPs ⋮ On sublinear inequalities for mixed integer conic programs ⋮ On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ A survey of hidden convex optimization ⋮ A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective ⋮ Two-term disjunctions on the second-order cone ⋮ (Global) optimization: historical notes and recent developments ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ A new framework to relax composite functions in nonlinear programs ⋮ Intersection cuts for convex mixed integer programs from translated cones ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ On Minimal Valid Inequalities for Mixed Integer Conic Programs ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem ⋮ The generalized trust region subproblem: solution complexity and convex hull results ⋮ Ideal formulations for constrained convex optimization problems with indicator variables ⋮ Maximal quadratic-free sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- 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
- Two-term disjunctions on the second-order cone
- Optimization with disjunctive constraints
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- 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
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Explicit convex and concave envelopes through polyhedral subdivisions
- A branch-and-cut method for 0-1 mixed convex programming
- Convex programming for disjunctive convex optimization
- The split closure of a strictly convex body
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- A convex-analysis perspective on disjunctive cuts
- Cuts for mixed 0-1 conic programming
- Computable representations for convex hulls of low-dimensional quadratic forms
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- 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
- A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs
- Lift-and-Project Cuts for Mixed Integer Convex Programs
- Convexification Techniques for Linear Complementarity Constraints
- Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
- Computing a Trust Region Step
- 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
- Convex hull of two quadratic constraints is an LMI set
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- Disjunctive Programming
- Solving the Trust-Region Subproblem using the Lanczos Method
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Two-Term Disjunctions on the Second-Order Cone
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- A Survey of the S-Lemma
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
This page was built for publication: How to convexify the intersection of a second order cone and a nonconvex quadratic
