scientific article; zbMATH DE number 1534289
From MaRDI portal
Publication:4517098
Cited in
(49)- Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming
- A sensitivity result for semidefinite programs.
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Gram spectrahedra of ternary quartics
- Extreme points of Gram spectrahedra of binary forms
- Kurdyka-Łojasiewicz exponent via inf-projection
- A survey of hidden convex optimization
- Amenable cones: error bounds without constraint qualifications
- A bound on the Carathéodory number
- Optimality conditions for nonlinear semidefinite programming via squared slack variables
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- Equivalence of two nondegeneracy conditions for semidefinite programs
- Local minima and convergence in low-rank semidefinite programming
- Characterizing the universal rigidity of generic tensegrities
- Deciding polyhedrality of spectrahedra
- Bad semidefinite programs: they all look the same
- Genericity results in linear conic programming -- a tour d'horizon
- On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials
- Some geometrical aspects of semidefinite linear complementarity problems
- Facial reduction algorithms for conic optimization problems
- Sharp recovery bounds for convex demixing, with applications
- A new semidefinite programming relaxation scheme for a class of quadratic matrix problems
- Some recent developments in spectrahedral computation
- Facial reduction and partial polyhedrality
- A note on strict complementarity for the doubly non-negative cone
- Extreme point inequalities and geometry of the rank sparsity ball
- Solving SDP completely with an interior point oracle
- On equivalent representations and properties of faces of the cone of copositive matrices
- Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
- Universal rigidity of bar frameworks via the geometry of spectrahedra
- On representer theorems and convex regularization
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- Characterizing bad semidefinite programs: normal forms and short proofs
- A semidefinite hierarchy for containment of spectrahedra
- Coordinate shadows of semidefinite and Euclidean distance matrices
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- Considering copositivity locally
- Error bounds, facial residual functions and applications to the exponential cone
- First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition
- Parametric conic optimization problems over semidefinite plus nonnegative cone
- A minimal face constant rank constraint qualification for reducible conic programming
- Properties of the complementarity set for the cone of copositive matrices
- Facial structure of copositive and completely positive cones over a second-order cone
- A nonsmooth, nonconvex optimization approach over sphere constraints for variants of regularized CCA and SVD
- Maximum likelihood thresholds of generic linear concentration models
- Characterizing the universal rigidity of generic frameworks
- First order solutions in conic programming
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517098)
