REFERENCES
F. Alizadeh, J.-P. A. Haeberly, and M. L. Overton, “Complementarity and nondegeneracy in semi-definite programming,” Math. Program., Ser. B, 77, 111–128 (1997).
J. F. Bonnans and A. Shapiro, Perturbation Analysis of Optimization Problems, Springer-Verlag, New York (2000).
A. L. Dontchev and R. T. Rockafellar, “Characterizations of Lipschitzian stability in nonlinear pro-gramming,” In: Mathematical Programming with Data Perturbations, Lect. Notes Pure Appl. Math., Vol. 195, Dekker, New York (1998), pp. 65–82.
Z. Q. Luo, J. S. Pang, and D. Ralph, Mathematical Programs with Equilibrium Constraints, Cam-bridge University Press, Cambridge (1996).
G.Pataki, “The geometry of semidefinite programming,”In: Semidefinite Programming and Applica-tions Handbook(R. Saigal, L. Vandenberghe, and H. Wolkowicz, Eds.), Kluwer Academic Publishers, Boston (2000), pp. 29–66.
S. M. Robinson, “Sensitivity analysis of variational inequalities by normal-map techniques,” In: Variational Inequalities and Network Equilibrium Problems, Plenum Press, New York (1995), pp. 257–269.
R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, New Jersey (1970).
A. Shapiro and M. K. H. Fan, “On eigenvalue optimization,” SIAM J. Optim., 5, 552–569 (1995).
A. Shapiro, “First and second order analysis of nonlinear semidefinite programs,” Math. Program., Ser. B, 77, 301–320 (1997).
Rights and permissions
About this article
Cite this article
Shapiro, A. Sensitivity Analysis of Generalized Equations. Journal of Mathematical Sciences 115, 2554–2565 (2003). https://doi.org/10.1023/A:1022940300114
Issue Date:
DOI: https://doi.org/10.1023/A:1022940300114