L Auslander, E Feig, et al.
Advances in Applied Mathematics
In this paper we consider a semidefinite programming (SDP) problem in which the objective function depends linearly on a scalar parameter. We study the properties of the optimal objective function value as a function of that parameter and extend the concept of the optimal partition and its range in linear programming to SDP. We also consider an approach to sensitivity analysis in SDP and the extension of our results to an SDP problem with a parametric right-hand side. © 1999 Elsevier Science B.V. and IMACS. All rights reserved.
L Auslander, E Feig, et al.
Advances in Applied Mathematics
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
Fernando Martinez, Juntao Chen, et al.
AAAI 2025
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University