Pages that link to "Item:Q1361074"
From MaRDI portal
The following pages link to Semidefinite programming relaxation for nonconvex quadratic programs (Q1361074):
Displaying 25 items.
- 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)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← 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)
- Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization (Q3058514) (← links)
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition (Q3648528) (← links)
- Semidefinite relaxation and nonconvex quadratic optimization (Q4391292) (← links)
- Copositive realxation for genera quadratic programming (Q4391294) (← 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 Doubly Positive Semidefinite Programming Relaxations (Q4688180) (← links)
- Semidefinite relaxation for linear programs with equilibrium constraints (Q4921222) (← 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)
- Nonlinear rescaling Lagrangians for nonconvex semidefinite programming (Q5169465) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems (Q5384603) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
- An Optimality Gap Test for a Semidefinite Relaxation of a Quadratic Program with Two Quadratic Constraints (Q5857291) (← 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)