Error Bounds for Linear Matrix Inequalities
From MaRDI portal
Recommendations
- Error bounds for inconsistent linear inequalities and programs
- New Error Bounds for the Linear Complementarity Problem
- Euclidean distance bounds for linear matrix inequalities analytic centers using a novel bound on the Lambert function
- Error bounds and singularity degree in semidefinite programming
- Error bounds for eigenvalue and semidefinite matrix inequality systems
Cited in
(49)- Computable error bounds for semidefinite programming
- Error bounds for inconsistent linear inequalities and programs
- Bounds for relative errors of complex matrix factorizations
- A unified approach to error bounds for structured convex optimization problems
- Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Analyticity of the central path at the boundary point in semidefinite programming
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- Kurdyka-Łojasiewicz exponent via inf-projection
- 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
- A rounding procedure for semidefinite optimization
- Bounds on the transformed errors of solutions to SLAEs with ill-conditioned matrices
- A strengthened Barvinok-Pataki bound on SDP rank
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem
- scientific article; zbMATH DE number 6718901 (Why is no real title available?)
- A Lipschitzian error bound for monotone symmetric cone linear complementarity problem
- Facial reduction and partial polyhedrality
- Error bounds for solutions of linear equations and inequalities
- Solving SDP completely with an interior point oracle
- Euclidean distance bounds for linear matrix inequalities analytic centers using a novel bound on the Lambert function
- On the simplicity and conditioning of low rank semidefinite programs
- An optimal-storage approach to semidefinite programming using approximate complementarity
- A note on alternating projections for ill-posed semidefinite feasibility problems
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- Coordinate shadows of semidefinite and Euclidean distance matrices
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Numerical Sensitivity of Linear Matrix Inequalities Using Shift and Delta Operators
- Singularity degree of the positive semidefinite matrix completion problem
- Error bounds and singularity degree in semidefinite programming
- Amenable cones are particularly nice
- On the identification of the optimal partition for semidefinite optimization
- Validating numerical semidefinite programming solvers for polynomial invariants
- 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?
- On the longest chain of faces of the completely positive and copositive cones
- Closing duality gaps of SDPs completely through perturbation when singularity degree is one
- Convergence rate of alternating projection method for the intersection of an affine subspace and the second-order cone
- An overview and comparison of spectral bundle methods for primal and dual semidefinite programs
- Tight error bounds for log-determinant cones without constraint qualifications
- The singularity degree of a face of the cone of copositive matrices
- Analyticity of weighted central paths and error bounds for semidefinite programming
This page was built for publication: Error Bounds for Linear Matrix Inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509761)
