Semidefinite programming relaxation for nonconvex quadratic programs

DOI10.1023/A:1008282830093zbMATH Open0881.90101OpenAlexW2020562473MaRDI QIDQ1361074FDOQ1361074

Authors: Tetsuya Fujie, Masakazu Kojima 

Publication date: 23 July 1997

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008282830093

Recommendations

• scientific article; zbMATH DE number 1380758
• Semidefinite relaxation and nonconvex quadratic optimization
• Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• New positive semidefinite relaxations for nonconvex quadratic programs
• Quadratic maximization and semidefinite relaxation
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• A note on set-semidefinite relaxations of nonconvex quadratic programs
• A relaxation method for nonconvex quadratically constrained quadratic programs

zbMATH Keywords

semidefinite programminglinear matrix inequalityrelaxation methodinterior-point methodnonconvex quadratic programquadratic inequality constraints

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Cited In (61)

• A guide to conic optimisation and its applications
• Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration
• A successive linear programming algorithm for SDP relaxation of binary quadratic programming
• Invariants of SDP exactness in quadratic programming
• Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization
• Convex hull results on quadratic programs with non-intersecting constraints
• A novel approach for solving semidefinite programs
• A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
• Title not available (Why is that?)
• Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods
• On the Slater condition for the SDP relaxations of nonconvex sets
• Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
• On zero duality gap in nonconvex quadratic programming problems
• Second order cone programming relaxation of nonconvex quadratic optimization problems
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
• New positive semidefinite relaxations for nonconvex quadratic programs
• Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
• Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
• A new approach to the stable set problem based on ellipsoids
• Unbounded convex sets for non-convex mixed-integer quadratic programming
• Nonlinear rescaling Lagrangians for nonconvex semidefinite programming
• Semidefinite programming for discrete optimization and matrix completion problems
• Exact dual bounds for some nonconvex minimax quadratic optimization problems
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
• Faster, but weaker, relaxations for quadratically constrained quadratic programs
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
• Causal state-feedback parameterizations in robust model predictive control
• On the tightness of SDP relaxations of QCQPs
• Penalized semidefinite programming for quadratically-constrained quadratic optimization
• Title not available (Why is that?)
• Convex relaxations for mixed integer predictive control
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
• Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
• Quadratic maximization and semidefinite relaxation
• Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms
• On the problem of packing spheres in a cube
• Extra resource allocation: a DEA approach in the view of efficiencies
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
• Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF
• Generalized S-lemma and strong duality in nonconvex quadratic programming
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
• Generating cutting planes for the semidefinite relaxation of quadratic programs
• Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
• Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems
• Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
• On the finite convergence of successive SDP relaxation methods
• On Convex Hulls of Epigraphs of QCQPs
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
• A projected gradient algorithm for solving the maxcut SDP relaxation
• Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
• Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
• A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
• From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
• Nonconvex quadratic programming, semidefinite relaxations and randomization algorithms in information and decision systems
• A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs

This page was built for publication: Semidefinite programming relaxation for nonconvex quadratic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361074)