On sensitivity of central solutions in semidefinite programming
From MaRDI portal
Publication:5935707
DOI10.1007/s101070100226zbMath0992.90051MaRDI QIDQ5935707
Publication date: 11 May 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31) Interior-point methods (90C51)
Related Items
Two optimal value functions in parametric conic linear programming ⋮ A Lipschitzian error bound for convex quadratic symmetric cone programming ⋮ An \(\epsilon\)-sensitivity analysis for semidefinite programming ⋮ Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling ⋮ A sensitivity result for semidefinite programs. ⋮ Robust portfolio selection based on a multi-stage scenario tree ⋮ Unifying optimal partition approach to sensitivity analysis in conic optimization ⋮ Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity ⋮ Perturbation analysis of singular semidefinite programs and its applications to control problems ⋮ Parametric analysis of semidefinite optimization ⋮ A primal-dual interior point method for parametric semidefinite programming problems ⋮ Polynomial primal-dual cone affine scaling for semidefinite programming ⋮ Symmetric primal-dual path-following algorithms for semidefinite programming ⋮ Analyticity of the central path at the boundary point in semidefinite programming
This page was built for publication: On sensitivity of central solutions in semidefinite programming