The following pages link to (Q4517098):
Displaying 44 items.
- On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials (Q317123) (← links)
- Facial reduction algorithms for conic optimization problems (Q368590) (← links)
- Sharp recovery bounds for convex demixing, with applications (Q404302) (← links)
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems (Q453058) (← links)
- Extreme point inequalities and geometry of the rank sparsity ball (Q494341) (← links)
- Universal rigidity of bar frameworks via the geometry of spectrahedra (Q522288) (← links)
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming (Q535069) (← links)
- Characterizing the universal rigidity of generic frameworks (Q741616) (← links)
- First order solutions in conic programming (Q890175) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming (Q1035905) (← links)
- A sensitivity result for semidefinite programs. (Q1417590) (← links)
- A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686) (← links)
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming (Q1702782) (← links)
- Gram spectrahedra of ternary quartics (Q2100058) (← links)
- Extreme points of Gram spectrahedra of binary forms (Q2136841) (← links)
- Kurdyka-Łojasiewicz exponent via inf-projection (Q2162122) (← links)
- A survey of hidden convex optimization (Q2176821) (← links)
- Amenable cones: error bounds without constraint qualifications (Q2227528) (← links)
- A bound on the Carathéodory number (Q2401297) (← links)
- Optimality conditions for nonlinear semidefinite programming via squared slack variables (Q2413085) (← links)
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property (Q2451678) (← links)
- Equivalence of two nondegeneracy conditions for semidefinite programs (Q2483041) (← links)
- Local minima and convergence in low-rank semidefinite programming (Q2487849) (← links)
- Characterizing the universal rigidity of generic tensegrities (Q2689816) (← links)
- Deciding Polyhedrality of Spectrahedra (Q2949514) (← links)
- Bad Semidefinite Programs: They All Look the Same (Q2967605) (← links)
- Genericity Results in Linear Conic Programming—A Tour d’Horizon (Q2976141) (← links)
- Some geometrical aspects of semidefinite linear complementarity problems (Q3377956) (← links)
- Some Recent Developments in Spectrahedral Computation (Q4556598) (← links)
- Facial Reduction and Partial Polyhedrality (Q4586172) (← links)
- A note on strict complementarity for the doubly non-negative cone (Q4634159) (← links)
- Solving SDP completely with an interior point oracle (Q4999336) (← links)
- On equivalent representations and properties of faces of the cone of copositive matrices (Q5044098) (← links)
- Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method (Q5219696) (← links)
- On Representer Theorems and Convex Regularization (Q5231664) (← links)
- Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP (Q5242927) (← links)
- Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs (Q5243181) (← links)
- A Semidefinite Hierarchy for Containment of Spectrahedra (Q5254998) (← links)
- Coordinate Shadows of Semidefinite and Euclidean Distance Matrices (Q5258947) (← links)
- Considering copositivity locally (Q5964425) (← links)
- Error bounds, facial residual functions and applications to the exponential cone (Q6044980) (← links)
- First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition (Q6052070) (← links)
- Parametric conic optimization problems over semidefinite plus nonnegative cone (Q6656648) (← links)
