Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones

References

• Adler I., Alizadeh F. Primal-dual interior point algorithms for convex quadratically constrained and semidefinite optimization problems. (1995) . Technical Report RRR-111-95, RUTCOR, Rutgers University, Piscataway, NJGoogle Scholar
• Alizadeh F. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. (1995) 5(1):13–51Crossref, Google Scholar
• Alizadeh F., Haeberly J. P., Overton M. L. Primal-dual interior-point methods for semi-definite programming: Convergence rates, stability and numerical results. SIAM J. Optim. (1998) 8(3):746–768Crossref, Google Scholar
• Alizadeh F., Schmieta S. H. Optimization with semidefinite, quadratic and linear constraints. (1997) . Technical Report RRR 23-97, RUTCOR, Rutgers University, Piscataway, NJ. Available at ⟨ http://rutcor.rutgers.edu/pub/rrr/reports97/23.ps⟩Google Scholar
• Faraut J., Korányi A.Analysis on Symmetric Cones (1994) (Oxford University Press, Oxford, U.K.) Crossref, Google Scholar
• Faybusovich L. Euclidean Jordan algebras and interior-point algorithms. Positivity I (1997a) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 331–357Google Scholar
• Faybusovich L. Linear systems in Jordan algebras and primal-dual interior point algorithms. J. Comput. Appl. Math. (1997b) 86:149–175Crossref, Google Scholar
• Helmberg C., Rendl F., Vanderbei R. J., Wolkowicz H. An interior-point method for semidefinite programming. SIAM J. Optim. (1996) 6:342–361Crossref, Google Scholar
• Jacobson N.Structure and Representation of Jordan Algebras (1968) XXXIX(American Mathematical Society, Providence, RI) Colloqium PublicationsCrossref, Google Scholar
• Kojima M., Mizuno S., Yoshise A., Megiddo N. A primal-dual interior-point algorithm for linear programming. Progress in Mathematical Programming (1989) (Springer Verlag, Berlin, Germany) Crossref, Google Scholar
• Kojima M., Shindoh S., Hara S. Interior-point methods for the monotone linear complementarity problem in symmetric matrices. SIAM J. Optim. (1997) 7(9):86–125Crossref, Google Scholar
• Luo Z.-Q., Sturm J. F., Zhang S. Superlinear convergence of a symmetric primal-dual path-following algorithm for semidefinite programming. SIAM J. Optim. (1998) 8(1):59–81Crossref, Google Scholar
• Monteiro R. D. C. Primal-dual path-following algorithms for semidefinite programming. SIAM J. Optim. (1997) 7:663–678Crossref, Google Scholar
• Monteiro R. D. C. Polynomial convergence of primal-dual algorithms for semidefinite programming based on Monteiro and Zhang family of directions. SIAM J. Optim. (1998) 8:797–812Crossref, Google Scholar
• Monteiro R. D. C., Adler I. Interior path following primal-dual algorithms. Part I: Linear programming. Math. Programming (1989) 44:27–41Crossref, Google Scholar
• Monteiro R. D. C., Tsuchiya T. Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming. SIAM J. Optim. (1999) 9(3):551–577Crossref, Google Scholar
• Monteiro R. D. C., Tsuchiya T. Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. Math. Programming (2000) 88:61–83Crossref, Google Scholar
• Monteiro R. D. C., Zanjacomo P. A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming. Math. Programming (1997) 78:393–396Crossref, Google Scholar
• Monteiro R. D. C., Zhang Y. A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Math. Programming (1998) 81:281–299Crossref, Google Scholar
• Nemirovski A., Scheinberg K. Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic programming. Math. Programming (1996) 72:273–289Crossref, Google Scholar
• Nesterov Y., Nemirovski A.Interior Point Polynomial Methods in Convex Programming: Theory and Applications (1994) (Society for Industrial and Applied Mathematics, Philadelphia, PA) Crossref, Google Scholar
• Nesterov Y., Todd M. J. Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. (1997) 22:1–42Link, Google Scholar
• Nesterov Y., Todd M. J. Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. (1998) 8:324–364Crossref, Google Scholar
• Potra F. A., Sheng R. A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming. SIAM J. Optim. (1998) 8(4):1007–1028Crossref, Google Scholar
• Schmieta S. H., Alizadeh F. Extension of commutative class of primal-dual interior point algorithms to symmetric cones. (1999) . Technical Report RRR 13-99, RUTCOR, Rutgers University, Piscataway, NJ. Available from ⟨ http://rutcor.rutgers.edu/pub/rrr/reports99/13.ps⟩Google Scholar
• Shimpuku T.Symmetric Algberas by Direct Product of Clifford Algebra (1988) (Seibunsha Publishers, Osaka, Japan) Google Scholar
• Todd M. J., Toh K. C., Tütüncü R. H. On the Nesterov-Todd direction in semidefinite programming. SIAM J. Optim. (1998) 8:769–796Crossref, Google Scholar
• Tseng P. Search directions and convergence analysis of some infeasible path-following methods for the monotone semi-definite LCP. Optim. Methods Software (1998) 9:245–268Crossref, Google Scholar
• Tsuchiya T. A polynomial primal-dual path-following algorithm for second-order cone programming. (1997) . Technical Report No. 649, The Institute of Statistical Mathematics, Tokyo, JapanGoogle Scholar
• Tsuchiya T. A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming. (1998) . Technical Report No. 664, The Institute of Statistical Mathematics, Tokyo, JapanGoogle Scholar
• Zhang Y. On extending primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. (1998) 8:356–386Crossref, Google Scholar