Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
From MaRDI portal
Publication:2897305
DOI10.1007/978-1-4614-1927-3_14zbMath1242.90155arXiv1206.1633OpenAlexW1878408459MaRDI QIDQ2897305
Pietro Belotti, Margot, François, Andrea Qualizza
Publication date: 10 July 2012
Published in: Mixed Integer Nonlinear Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.1633
Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Linear programming (90C05)
Related Items
Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Bound reduction using pairs of linear inequalities, Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices, Cutting Plane Generation through Sparse Principal Component Analysis, Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning, Semidefinite relaxations for non-convex quadratic mixed-integer programming, Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2, Partial Lasserre relaxation for sparse Max-Cut, Outer-product-free sets for polynomial optimization and oracle-based cuts, Subset Selection and the Cone of Factor-Width-k Matrices, On linear programs with linear complementarity constraints, A distributed continuous-time method for non-convex QCQPs, Computation of weighted sums of rewards for concurrent MDPs, Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem, Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, An integer linear programming approach for a class of bilinear integer programs, DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs, On Minimal Valid Inequalities for Mixed Integer Conic Programs, Exact dual bounds for some nonconvex minimax quadratic optimization problems, Template polyhedra and bilinear optimization, An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs, On the separation of split inequalities for non-convex quadratic integer programming, Sparse PSD approximation of the PSD cone
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Disjunctive programming: Properties of the convex hull of feasible points
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Novel approaches to hard discrete optimization
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Algorithm 875
- On Nonconvex Quadratic Programming with Box Constraints
- Jointly Constrained Biconvex Programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- CSDP, A C library for semidefinite programming
- Semidefinite Programming
- Nonlinear Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
