References
- Baes M. Spectral functions and smoothing techniques on Jordan algebras. Saarbrücken: Lambert Academic Publishing; 2009.
- Burke JV, Deng S. Weak sharp minima revisited. I. Basic theory. Control Cybernet. 2002;31:439–469.
- Burke JV, Deng S. Weak sharp minima revisited. II. Application to linear regularity and error bounds. Math. Program. 2005;104:235–261.
- Burke JV, Deng S. Weak sharp minima revisited. III. Error bounds for differentiable convex inclusions. Math. Program. 2009;116:37–56.
- Burke JV, Ferris MC. Weak sharp minima in mathematical programming. SIAM J. Control Optim. 1993;31:1340–1359.
- Chua CB. Analyticity of weighted central path and error bounds for semidefinite programming. Math. Program. 2008;115:239–271.
- Facchinei F, Pang JS. Finite-dimensional variational inequalities and complementarity problems. Vol. I. New York (NY): Springer-Verlag; 2003.
- Faraut J, Koranyi A. Analysis on symmetric cones. New York (NY): Oxford University Press; 1994.
- Faybusovich L. Euclidean Jordan algebras and interior-point algorithms. Positivity. 1997;1:331–357.
- Faybusovich L. Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 1997;86:149–175.
- Giannessi F, Maugeri A. Variational analysis and applications. Vol. 79, Nonconvex optimization and its applications. New York (NY): Springer-Verlag; 2005.
- Gowda MS, Sznajder R. Schur complements, Schur determinantal and Haynsworth inertia formulas in Euclidean Jordan algebras. Linear Algebra Appl. 2010;432:1553–1559.
- Gowda MS, Tao J. The Cauchy interlacing theorem in simple Euclidean Jordan algebras and some consequences. Linear Multilinear Algebra. 2011;59:65–86.
- Kojima M, Shindoh S, Hara S. Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 1997;7:86–125.
- Kong L, Tunçel L, Xiu N. Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming. J. Optim. Theory Appl. 2011;148:364–389.
- Lesaja G, Roos C. Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones. J. Optim. Theory Appl. 2011;150:444–474.
- Lu Z, Monteiro RDC. Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming. Optim. Methods Softw. 2007;22:849–870.
- McCrimmon K. A taste of Jordan algebras. New York (NY): Springer-Verlag; 2004.
- Pang JS. Error bounds in mathematical programming. Math. Program. 1997;79:299–332.
- Schmieta SH, Alizadeh F. Extension of primal-dual interior point algorithms to symmetric cones. Math. Program. 2003;96:409–438.
- Sturm JF. Error bounds for linear matrix inequalities. SIAM J. Optim. 2000;10:1228–1248.
- Sturm JF, Zhang S. On sensitivity of central solutions in semidefinite programming. Math. Program. 2001;90:205–227.
- Sun D, Sun J. Löwner’s operator and spectral functions in Euclidean Jordan algebras. Math. Oper. Res. 2008;33:421–445.
- Vieira M. Interior-point methods based on kernel functions for symmetric optimization. Optim. Methods Softw. 2012;27:513–537.