Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
From MaRDI portal
Publication:717135
DOI10.1007/s10107-011-0462-2zbMath1232.49035OpenAlexW2019855902MaRDI QIDQ717135
Mohit Tawarmalani, Xiaowei Bao, Nikolaos V. Sahinidis
Publication date: 27 September 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0462-2
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods involving duality (49M29)
Related Items
A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program, Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems, Global solutions to a class of CEC benchmark constrained optimization problems, On Convex Hulls of Epigraphs of QCQPs, On the tightness of SDP relaxations of QCQPs, Exact quadratic convex reformulations of mixed-integer quadratically constrained problems, A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming, On conic QPCCs, conic QCQPs and completely positive programs, A fair division approach to humanitarian logistics inspired by conditional value-at-risk, Exactness conditions for an SDP relaxation of the extended trust region problem, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Generating cutting planes for the semidefinite relaxation of quadratic programs, The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems, GLOMIQO: global mixed-integer quadratic optimizer, Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, Literature reviews in operations research: a new taxonomy and a meta review, Facets of a mixed-integer bilinear covering set with bounds on variables, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint, A reformulation-linearization technique for optimization over simplices, New bounds for nonconvex quadratically constrained quadratic programming, Linear programing relaxations for a strategic pricing problem in electricity markets, Improved convex and concave relaxations of composite bilinear forms, Representing quadratically constrained quadratic programs as generalized copositive programs, Sign patterns of inverse doubly-nonnegative matrices, A guide to conic optimisation and its applications, A branch-and-bound algorithm for solving max-\(k\)-cut problem, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, Optimal portfolio deleveraging under market impact and margin restrictions, Satisfactory fault tolerant control with soft-constraint for discrete time-varying systems: numerical recursive approach, Global solution of non-convex quadratically constrained quadratic programs, Unnamed Item, An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints, Relaxations and discretizations for the pooling problem, How to convexify the intersection of a second order cone and a nonconvex quadratic, A new algorithm for concave quadratic programming, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Penalized semidefinite programming for quadratically-constrained quadratic optimization, The exact solution of multiparametric quadratically constrained quadratic programming problems, Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming, Extensions on ellipsoid bounds for quadratic integer programming, Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm, A gentle, geometric introduction to copositive optimization, A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues, Exact SDP relaxations of quadratically constrained quadratic programs with forest structures, An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- RLT: A unified approach for discrete and continuous nonconvex optimization
- Semidefinite programming for discrete optimization and matrix completion problems
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Dual quadratic estimates in polynomial and Boolean programming
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- Dual estimates in multiextremal problems
- Process planning in a fuzzy environment
- A new semidefinite programming bound for indefinite quadratic forms over a simplex
- Semidefinite programming relaxation for nonconvex quadratic programs
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- An independent benchmarking of SDP and SOCP solvers
- Packing equal circles in a square: A deterministic global optimization approach
- A polyhedral branch-and-cut approach to global optimization
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A note on lack of strong duality for quadratic problems with orthogonal constraints
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Improved SDP bounds for minimizing quadratic functions over the \(\ell^{1}\)-ball
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- D.C. versus copositive bounds for standard QP
- Computable representations for convex hulls of low-dimensional quadratic forms
- Quadratic programming is in NP
- Lectures on Modern Convex Optimization
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Algorithm 875
- Jointly Constrained Biconvex Programming
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Copositive realxation for genera quadratic programming
- CSDP, A C library for semidefinite programming
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Convex Analysis
- A Survey of the S-Lemma
- Handbook of semidefinite programming. Theory, algorithms, and applications
- On copositive programming and standard quadratic optimization problems
