Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank

Mathematical Programming, Series B

Volumn 97, Issue 3, 2003, Pages 471-493

  Faybusovich, Leonid ^a   Tsuchiya, Takashi ^b  

^a UNIVERSITY OF NOTRE DAME   (United States)

^b INSTITUTE OF STATISTICAL MATHEMATICS   (Japan)

Author keywords

Infinite dimensional problems; Jb algebras; Optimal control problems; Polynomial time primal dual interior point methods

Indexed keywords

ALGEBRA; ALGORITHMS; DIFFERENTIAL EQUATIONS; ITERATIVE METHODS; LINEAR PROGRAMMING;

INFINITE DIMENSIONAL PROBLEMS; JB-ALGEBRAS; OPTIMAL CONTROL PROBLEMS; POLYNOMIAL-TIME PRIMAL-DUAL INTERIOR-POINT METHODS;

COMPUTATIONAL METHODS;

EID: 1842436899     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0424-4     Document Type: Article

References (17)

1. Faraut, J., Koráyi, A.: Anal, on Symmetric Cones. Oxford University Press, New York, 1994
2. Faybusovich, L.: Euclidean Jordan algebras and interior-point algorithms. Positivity 1, 331-357 (1997)
3. Faybusovich, L.: Linear systems in Jordan algebras and primal-dual interior-point algorithms. J. Comput. Appl. Math. 86, 149-175 (1997)
4. Faybusovich, L.: A Jordan-algebraic approach to potential-reduction algorithms. Math. Z. 239, 117-129 (2002)
5. Faybusovich, L., Arana, R.: A long-step primal-dual algorithm for the symmetric programming problem. Syst. Control Lett. 43, 3-7 (2001)
6. Faybusovich, L., Moore, J.B.: Infinite-dimensional quadratic optimization: interior-point methods and control applications. Appl. Math. Optim. 36, 43-66 (1997)
7. Faybusovich, L., Mouktonglang, T.: Finite-Rank Perturbation of the Linear-Quadratic control problem, preprint 2002. (To appear in in Proceedings of American Control Conference, Denver 2003.)
8. Wilhelm Kaup: Jordan algebras and holomorphy. Functional analysis, holomorphy, and approximation theory (Proc. Sem., Univ. Fed. Rio de Janeiro, Rio de Janeiro, 1978), pp. 341-365, Lecture Notes in Mathematics, Vol. 843, Springer, Berlin, 1981
9. 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. Prog. 88(1), 61-83 (2000)
10. Monteiro, R.D.C., Zhang, Y.: A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming. Math. Prog. 81(3), 281-299 (1998)
11. Muramatsu, M.: On a commutative class of search directions for linear programming over symmetric cones. J. Optim. Theor. its Appl. 112(3), 595-625 (2002)
12. Nemirovskii, A., Scheinberg, K.: Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems. Math. Prog. 72(3), 273-289 (1996)
13. Nesterov, Y.E., Todd, M.: Self-scaled barriers and interior-point methods for convex programming. Math. Operet. Res. 22, 1-42 (1997)
14. Schmieta, S., Alizadeh, F.: Extensions of primal-dual interior point algorithms to symmetric cones. Report RRR 13-99, RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854-8003, 1999
15. Sturm, J.F.: Similarity and other spectral relations for symmetric cones. Linear Algebra and its Appl. 312(1-3), 135-154 (2000)
16. Tsuchiya, T.: A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming. Optim. Methods and Softw. 11&12, 141-182 (1999)
17. Wright, S.: Primal-dual Interior Point Algorithms. SIAM Publications, Philadelphia, Pennsylvania, USA, 1997