Pages that link to "Item:Q1361074"
From MaRDI portal
The following pages link to Semidefinite programming relaxation for nonconvex quadratic programs (Q1361074):
Displaying 41 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations (Q645557) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization (Q721146) (← links)
- Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Extra resource allocation: a DEA approach in the view of efficiencies (Q1655921) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- On the finite convergence of successive SDP relaxation methods (Q1848385) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Exact dual bounds for some nonconvex minimax quadratic optimization problems (Q2043977) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures (Q2182857) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- On the problem of packing spheres in a cube (Q2263331) (← links)
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming (Q2274889) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- A novel approach for solving semidefinite programs (Q2336591) (← links)
- Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
- Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Causal state-feedback parameterizations in robust model predictive control (Q2628475) (← links)
- A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) (← links)
- Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
- Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF (Q2817919) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition (Q3648528) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration (Q4636381) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization (Q5151536) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
- Invariants of SDP exactness in quadratic programming (Q6184179) (← links)
