Charles A Micchelli
Journal of Approximation Theory
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.
Charles A Micchelli
Journal of Approximation Theory
W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991
Satoshi Hada
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998