Error Bounds for Linear Matrix Inequalities

DOI10.1137/S1052623498338606zbMath0999.90027MaRDI QIDQ4509761

Jos F. Sturm

Publication date: 19 October 2000

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

semidefinite programminglinear matrix inequalityerror boundsregularized duality

Mathematics Subject Classification ID

Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)

Related Items (35)

On the identification of the optimal partition for semidefinite optimization ⋮ A Lipschitzian error bound for monotone symmetric cone linear complementarity problem ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ A unified approach to error bounds for structured convex optimization problems ⋮ A strengthened Barvinok-Pataki bound on SDP rank ⋮ Facial Reduction and Partial Polyhedrality ⋮ A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs ⋮ Revisiting degeneracy, strict feasibility, stability, in linear programming ⋮ Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates ⋮ A strict complementarity approach to error bound and sensitivity of solution of conic programs ⋮ How Do Exponential Size Solutions Arise in Semidefinite Programming? ⋮ Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction ⋮ Amenable cones: error bounds without constraint qualifications ⋮ Reduction of SISO H-infinity output feedback control problem ⋮ Analyticity of weighted central paths and error bounds for semidefinite programming ⋮ A note on alternating projections for ill-posed semidefinite feasibility problems ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity ⋮ Singularity Degree of the Positive Semidefinite Matrix Completion Problem ⋮ Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Perturbation analysis of singular semidefinite programs and its applications to control problems ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity ⋮ A rounding procedure for semidefinite optimization ⋮ On the finite termination of the Douglas-Rachford method for the convex feasibility problem ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ Solving SDP completely with an interior point oracle ⋮ Analyticity of the central path at the boundary point in semidefinite programming ⋮ Error Bounds and Singularity Degree in Semidefinite Programming ⋮ Coordinate Shadows of Semidefinite and Euclidean Distance Matrices ⋮ Amenable Cones Are Particularly Nice ⋮ Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach

This page was built for publication: Error Bounds for Linear Matrix Inequalities