scientific article; zbMATH DE number 1534289
From MaRDI portal
Publication:4517098
zbMath0957.90531MaRDI QIDQ4517098
Publication date: 22 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (43)
On equivalent representations and properties of faces of the cone of copositive matrices ⋮ Extreme points of Gram spectrahedra of binary forms ⋮ On bounds of the Pythagoras number of the sum of square magnitudes of Laurent polynomials ⋮ Some Recent Developments in Spectrahedral Computation ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ A bound on the Carathéodory number ⋮ Facial reduction algorithms for conic optimization problems ⋮ A survey of hidden convex optimization ⋮ Optimality conditions for nonlinear semidefinite programming via squared slack variables ⋮ Facial Reduction and Partial Polyhedrality ⋮ A fresh CP look at mixed-binary QPs: new formulations and relaxations ⋮ Deciding Polyhedrality of Spectrahedra ⋮ First order solutions in conic programming ⋮ 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 ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ Characterizing the universal rigidity of generic tensegrities ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ A sensitivity result for semidefinite programs. ⋮ Genericity Results in Linear Conic Programming—A Tour d’Horizon ⋮ A new semidefinite programming relaxation scheme for a class of quadratic matrix problems ⋮ Positive semidefinite matrix completion, universal rigidity and the strong Arnold property ⋮ Amenable cones: error bounds without constraint qualifications ⋮ A note on strict complementarity for the doubly non-negative cone ⋮ Extreme point inequalities and geometry of the rank sparsity ball ⋮ Universal rigidity of bar frameworks via the geometry of spectrahedra ⋮ Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming ⋮ Equivalence of two nondegeneracy conditions for semidefinite programs ⋮ Local minima and convergence in low-rank semidefinite programming ⋮ Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems ⋮ Considering copositivity locally ⋮ Characterizing the universal rigidity of generic frameworks ⋮ Some geometrical aspects of semidefinite linear complementarity problems ⋮ Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method ⋮ On Representer Theorems and Convex Regularization ⋮ Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ Solving SDP completely with an interior point oracle ⋮ A Semidefinite Hierarchy for Containment of Spectrahedra ⋮ Gram spectrahedra of ternary quartics ⋮ Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
This page was built for publication:
