Pages that link to "Item:Q2188238"
From MaRDI portal
The following pages link to Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238):
Displaying 25 items.
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
- On the local stability of semidefinite relaxations (Q2144546) (← links)
- On sparsity of the solution to a random quadratic optimization problem (Q2227539) (← links)
- Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs'' (Q2235166) (← links)
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables (Q2670502) (← links)
- On indefinite quadratic optimization over the intersection of balls and linear constraints (Q2671444) (← links)
- On Convex Hulls of Epigraphs of QCQPs (Q5041762) (← links)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
- On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations (Q5072594) (← links)
- Cutting Plane Generation through Sparse Principal Component Analysis (Q5081781) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
- KKT-based primal-dual exactness conditions for the Shor relaxation (Q6104908) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Convex hull results on quadratic programs with non-intersecting constraints (Q6126659) (← links)
- Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity (Q6136657) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Exact SDP relaxations for quadratic programs with bipartite graph structures (Q6173960) (← links)
- Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications (Q6180358) (← links)
- Invariants of SDP exactness in quadratic programming (Q6184179) (← links)
- On exact and inexact RLT and SDP-RLT relaxations of quadratic programs with box constraints (Q6618144) (← links)
- Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)
