Abstract
The Q method of semidefinite programming, developed by Alizadeh, Haeberly and Overton, is extended to optimization problems over symmetric cones. At each iteration of the Q method, eigenvalues and Jordan frames of decision variables are updated using Newton’s method. We give an interior point and a pure Newton’s method based on the Q method. In another paper, the authors have shown that the Q method for second-order cone programming is accurate. The Q method has also been used to develop a “warm-starting” approach for second-order cone programming. The machinery of Euclidean Jordan algebra, certain subgroups of the automorphism group of symmetric cones, and the exponential map is used in the development of the Newton method. Finally we prove that in the presence of certain non-degeneracies the Jacobian of the Newton system is nonsingular at the optimum. Hence the Q method for symmetric cone programming is accurate and can be used to “warm-start” a slightly perturbed symmetric cone program.
Similar content being viewed by others
References
Alizadeh, F., Haeberly, J.P., Overton, M.L.: A new primal-dual interior point method for semidefinite programming. In: Proc. 5th SIAM Conference on Appl. Linear Algebra, Snowbird, Utah (1994)
Alizadeh, F., Haeberly, J.-P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8(3), 746–768 (1998)
Xia, Y., Alizadeh, F.: The q method for second order cone programming. Comput. Oper. Res. 35(5), 1510–1538 (2008)
Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11/12(1–4), 625–653 (1999). Interior point methods
Xia, Y.: A Newton’s method for perturbed second-order cone programs. Comput. Optim. Appl. 37(3), 371–408 (2007)
Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5(1), 13–51 (1995)
Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming. Springer, Berlin (1989)
Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior-point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming, Berlin. Springer, Berlin (1989)
Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms. Part I: Linear programming. Math. Program. 44, 27–41 (1989)
Monteiro, R.D.C.: Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. 7, 663–678 (1997)
Zhang, Y.: On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 356–386 (1998)
Gu, M.: Primal-dual interior-point methods for semidefinite programming in finite precision. SIAM J. Optim. 10(2), 462–502 (2000)
Güler, O.: Barrier functions in interior point methods. Math. Oper. Res. 21, 860–885 (1996)
Faybusovich, L.: Euclidean Jordan algebras and interior-point algorithms. Positivity 1(4), 331–357 (1997)
Faybusovich, L.: Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86(1), 149–175 (1997). Special issue dedicated to William B. Gragg (Monterey, CA, 1996)
Schmieta, S.H., Alizadeh, F.: Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones. Math. Oper. Res. 26(3), 543–564 (2001)
Schmieta, S.H., Alizadeh, F.: Extension of commutative class of primal-dual interior point algorithms to symmetric cones. Math. Program. 96, 409–438 (2003)
Schmieta, S.H.: Application of Jordan algebras to the design and analysis of interior-point algorithms for linear, quadratically constrained quadratic, and semi-definite programming. PhD thesis, Rutgers Center for Operations Research, Rutgers University (1999)
Faraut, J., Korányi, A.: Analysis on Symmetric Cones. Clarendon/Oxford University Press, New York (1994). Oxford Science Publications
Koecher, M.: The Minnesota Notes on Jordan Algebras and Their Applications. Springer, Berlin (1999). Edited by Kreig, A. and Walcher, S. based on Lectures given in The University of Minnesota, 1960
Alizadeh, F., Schmieta, S.H.: Symmetric cones, potential reduction methods and word-by-word extensions. In: Saigal, R., Vandenberghe, L., Wolkowicz, H. (eds.) Handbook of Semidefinite Programming, Theory, Algorithms and Applications, pp. 195–233. Kluwer Academic, Norwell (2000)
Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. Ser. B (2002). doi:10.1007/s10107-002-0339-5
Horn, R., Johnson, C.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1990)
Jacobson, N.: Structure and Representation of Jordan Algebras. Colloqium Publications, vol. XXXIX. American Mathematical Society, Providence (1968)
Xia, Y.: A Newton’s method for perturbed second-order cone programs. Comput. Optim. Appl. 37(3), 371–408 (2007)
Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983). A Wiley-Interscience Publication
Dennis, J.E. Jr., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (1983)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by F. Potra.
Research of F. Alizadeh was supported in part by the U.S. National Science Foundation.
Rights and permissions
About this article
Cite this article
Alizadeh, F., Xia, Y. The Q Method for Symmetric Cone Programming. J Optim Theory Appl 149, 102–137 (2011). https://doi.org/10.1007/s10957-010-9777-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-010-9777-z