Convex hull of two quadratic or a conic quadratic and a quadratic inequality
From MaRDI portal
Publication:2364498
DOI10.1007/S10107-016-1084-5zbMath1393.90074OpenAlexW2553712146MaRDI QIDQ2364498
Sina Modaresi, Juan Pablo Vielma
Publication date: 21 July 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/109951
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (14)
On Convex Hulls of Epigraphs of QCQPs ⋮ On the tightness of SDP relaxations of QCQPs ⋮ 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 Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ 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 ⋮ Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs ⋮ 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 ⋮ The generalized trust region subproblem: solution complexity and convex hull results
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- SCIP: solving constraint integer programs
- Conic mixed-integer rounding cuts
- Two-term disjunctions on the second-order cone
- Chvátal closures for mixed integer programming problems
- Equivalence between intersection cuts and the corner polyhedron
- Valid inequalities for mixed integer linear programs
- Lift-and-project cuts for convex mixed integer nonlinear programs
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Disjunctive cuts for cross-sections of the second-order cone
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- A branch-and-cut method for 0-1 mixed convex programming
- On the Chvátal-Gomory closure of a compact convex set
- The split closure of a strictly convex body
- On families of quadratic surfaces having fixed intersections with two hyperplanes
- Some polyhedra related to combinatorial problems
- Cuts for mixed 0-1 conic programming
- On Minimal Valid Inequalities for Mixed Integer Conic Programs
- The Chvátal-Gomory Closure of a Strictly Convex Body
- 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
- Convex hull of two quadratic constraints is an LMI set
- Polyhedral Approaches to Mixed Integer Linear Programming
- Mixed Integer Programming Computation
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- A Strong Dual for Conic Mixed-Integer Programs
- Intersection Cuts for Mixed Integer Conic Quadratic Sets
- Cuts for Conic Mixed-Integer Programming
- Some continuous functions related to corner polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
This page was built for publication: Convex hull of two quadratic or a conic quadratic and a quadratic inequality
