An ϵ-sensitivity analysis for semidefinite programming

Optimality and invexity in optimization problems in Banach algebras (spaces)

“…Recall that semidefinite programming is a vital optimization field where the feasible region is an affine subspace of the cone of positive semidefinite matrices [32][33][34]. Semidefinite programming can be regarded as an extension of linear programming by vector variables replaced with matrix variables and elementwise nonnegativity replaced by positive semidefiniteness [32][33][34].…”

“…Nowadays semidefinite programming is given much attention thanks to its many applications in combinatorial optimization and especially in control theory, as well as the development of efficient and practical interior-point methods. Consider a linear semidefinite problem as follows [33]:…”