Parametric analysis of semidefinite optimization
Preprint
Abstract
In this paper, we study parametric analysis of semidefinite optimization problems w.r.t. the perturbation of the objective function. We study the behavior of the optimal partition and optimal set mapping on a so-called nonlinearity interval. Furthermore, we investigate the sensitivity of the approximation of the optimal partition in a nonlinearity interval, which has been recently studied by Mohammad-Nezhad and Terlaky. The approximation of the optimal partition was obtained from a bounded sequence of interior solutions on, or in a neighborhood of the central path. We derive an upper bound on the distance between the approximations of the optimal partitions of the original and perturbed problems. Finally, we examine the theoretical bounds by way of experimentation.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- On the local stability of semidefinite relaxationsMathematical Programming, 2021
- Perturbation Analysis of Singular Semidefinite Programs and Its Applications to Control ProblemsJournal of Optimization Theory and Applications, 2020
- The geometry of SDP-exactness in quadratic optimizationMathematical Programming, 2019
- A rounding procedure for semidefinite optimizationOperations Research Letters, 2019
- Sensitivity analysis in linear programming and semidefinite programming using interior-point methodsMathematical Programming, 2001
- On sensitivity of central solutions in semidefinite programmingMathematical Programming, 2001
- First and second order analysis of nonlinear semidefinite programsMathematical Programming, 1997
- Complementarity and nondegeneracy in semidefinite programmingMathematical Programming, 1997
- The use of the optimal partition in a linear programming solution for postoptimal analysisOperations Research Letters, 1994
- A geometric view of parametric linear programmingAlgorithmica, 1992