Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
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.
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Alfred K. Wong, Antoinette F. Molless, et al.
SPIE Advanced Lithography 2000
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences