Full Nesterov-Todd step infeasible interior-point method for symmetric optimization

European Journal of Operational Research

Volumn 214, Issue 3, 2011, Pages 473-484

  Gu, G ^a   Zangiabadi, M ^b   Roos, C ^c  

^a NANJING UNIVERSITY   (China)

^b SHAHREKORD UNIVERSITY   (Iran)

^c Delft University of Technology ^*  (Netherlands)

Author keywords

Conic programming; Interior point methods; Nesterov Todd step

Indexed keywords

LARGE SCALE SYSTEMS;

CONIC PROGRAMMING; EUCLIDEAN JORDAN ALGEBRA; INFEASIBLE INTERIOR POINT METHOD; INTERIOR POINT ALGORITHM; INTERIOR-POINT METHOD; NESTEROV-TODD STEP; SEMIDEFINITE OPTIMIZATION; SYMMETRIC OPTIMIZATIONS;

LINEAR PROGRAMMING;

EID: 84856501896     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.02.022     Document Type: Article

References (22)

1. Ben-Tal, A., Nemirovski, A., 2001. Lectures on modern convex optimization. MPS/SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, Analysis, Algorithms, and Engineering Applications.
2. de Klerk, E., 2002. Aspects of semidefinite programming. Applied Optimization. Interior Point Algorithms and Selected Applications, vol. 65. Kluwer Academic Publishers, Dordrecht.
3. Faraut, J., Korányi, A., 1994. Analysis on symmetric cones. Oxford Mathematical Monographs. Oxford Science Publications/The Clarendon Press Oxford University Press, New York.
4. Faybusovich, L., 1997a. Euclidean Jordan algebras and interior-point algorithms. Positivity 1 (4), 331-357.
5. Faybusovich, L., 1997b. Linear systems in Jordan algebras and primal-dual interiorpoint algorithms. Journal of Computational and Applied Mathematics 86 (1), 149-175. special issue dedicated to William B. Gragg (Monterey, CA, 1996). (Pubitemid 127422552)
6. Faybusovich, L., 2002. A Jordan-algebraic approach to potential-reduction algorithms. Mathematische Zeitschrift 239 (1), 117-129. (Pubitemid 36195134)
7. Güler, O., 1996. Barrier functions in interior point methods. Mathematics of Operations Research 21 (4), 860-885. (Pubitemid 126600363)
8. Kojima, M., Megiddo, N., Mizuno, S., 1993. A primal-dual infeasible-interior-point algorithm for linear programming. Mathematical Programming 61 (3, Ser. A), 263-280.
9. Lustig, I.J., 1990/91. Feasibility issues in a primal-dual interior-point method for linear programming. Mathematical Programming 49 (2, Ser. A), 145-162.
10. Mizuno, S., 1994. Polynomiality of infeasible-interior-point algorithms for linear programming. Mathematical Programming 67 (1, Ser. A), 109-119.
11. Nesterov, Y., Nemirovskii, A., 1994. Interior-point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics. Society for Industrial and Applied Mathematics, vol. 13. SIAM, Philadelphia, PA.
12. Nesterov, Y.E., Todd, M.J., 1997. Self-scaled barriers and interior-point methods for convex programming. Mathematics of Operations Research 22 (1), 1-42. (Pubitemid 127621312)
13. Nesterov, Y.E., Todd, M.J., 1998. Primal-dual interior-point methods for self-scaled cones. SIAM Journal on Optimization 8 (2), 324-364. electronic.
14. Potra, F.A., 1996. An infeasible-interior-point predictor-corrector algorithm for linear programming. SIAM Journal on Optimization 6 (1), 19-32.
15. Rangarajan, B.K., 2006. Polynomial convergence of infeasible-interior- point methods over symmetric cones. SIAM Journal on Optimization 16 (4), 1211-1229. electronic. (Pubitemid 44729419)
16. Roos, C., 2006. A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM Journal on Optimization 16 (4), 1110-1136. (Pubitemid 44729414)
17. Roos, C., Terlaky, T., Vial, J.-P., 2006. Interior point methods for linear optimization, second ed. Theory and algorithms for linear optimization Springer, New York [Wiley, Chichester, 1997; MR1450094].
18. Schmieta, S.H., Alizadeh, F., 2001. Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones. Mathematics of Operations Research 26 (3), 543-564. (Pubitemid 34047205)
19. Schmieta, S.H., Alizadeh, F., 2003. Extension of primal-dual interior point algorithms to symmetric cones. Mathematical Programming 96 (3, Ser. A), 409-438.
20. Sturm, J.F., 2000. Similarity and other spectral relations for symmetric cones. Linear Algebra and its Applications 312 (1-3), 135-154.
21. Vieira, M.V.C., 2007. Jordan algebraic approach to symmetric optimization. Ph.D. thesis, Delft University of Technology.
22. Zhang, Y., 1994. On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM Journal on Optimization 4 (1), 208-227.