The central path in smooth convex semidefinite programs

Optimization

Volumn 51, Issue 2, 2002, Pages 207-233

  Grana Drummond L M ^a   Peterzil, Y ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Central path; Convex programming; Logarithmic barrier function; Nonlinear semidefinite programming; O minimal structures; Semidefinite programming

Indexed keywords

EID: 0036554068     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331930290019396     Document Type: Article

References (34)

1. Alizadeh, F., Haeberly, J.-P.A. and Overton, M.L. (1997). "Complementarity and nondegeneracy in semidefinite programming", Mathematical programming, 77, 111-128.
2. Bayer, D. and Lagarias, J.C. (1986). "The non-linear geometry of linear programming", AT & Bell Laboratories, Murray Hill, NJ, preprint.
3. van den Dries, L. (1998). Tame topology and o-minimal structures, London Mathematical Society Lecture Notes Series 248, Cambridge University Press.
4. van den Dries, L., Macintyre, A. and Marker, D. (1994). "The elementary theory of restricted analytic fields with exponentiation", Ann. Math., 140, 183-205.
5. van den Dries, L. and Miller, C. (1994). "On the real exponential field with restricted analytic functions", Israel J. Math., 85, 19-56.
6. van den Dries, L. and Miller, C. (1996). "Geometric categories and o-minimal structure", Duke Math. J., 84, 497-540.
7. van den Dries, L. and Speissegger, P. (1998). "The field of reals with multisumable series and the exponential function", Preprint.
8. Fiacco, A. and McCormik, G.P. (1990). Nonlinear Programming: Sequential Unconstrained Techniques, Classics in Applied Mathematics, SIAM Publications, Philadelphia.
9. Goldfarb, D. and Sheinberg, K. (1996). "Interior point trajectories in semidefinite programming", Preprint.
10. Graña Drummond, L.M. and Iusem, A.N. (2000). "Welldefinedness and limiting behavior of the central path", Computational and Applied Mathematics, 19(1), 57-78.
11. Graña Drummond, L.M., Iusem, A.N. and Svaiter, B.F. (2000). "On the central path for nonlinear semidefinite programming", RAIRO Operations Research, 34, 331-345.
12. Iusem, A.N., Svaiter, B.F. and Da Cruz Neto, J.X. (1999). "Central paths, generalized proximal point methods and Cauchy trajectories in Riemann manifolds", SIAM Journal on Control and Optimization, 37, 566-588.
13. Karmarkar, N. (1984). "A new polynomial time algorithm for linear programming", Combinatorica, 4, 373-395.
14. Khachiyan, L.G. (1979), "A polynomial algorithm for linear programming", Soviet Mathematics Doklady, 20, 191-194.
15. Kojima, M., Mizuno, S. and Toma, T. (1990). "Limiting behavior of trajectories by a continuation method for complementary problems", Mathematics of Operations Research, 15, 662-675.
16. Kojima, M., Megiddo, N., Noma, T. and Yoshise, A. (1991). A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Springer-Verlag, Berlin.
17. Kojima, M., Shindoh, S. and Hara, S. (1997). "Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices", SIAM Journal on Optimization, 7(1), 86-125.
18. Mangasarian, O.L. (1969). Nonlinear programming, Mc Graw-Hill, New York.
19. Megiddo, N. (1988). "Pathways to the optimal set in linear programming", In: Progress in Mathematical Programming-Interior Point and Related Methods, Megiddo, N., Springer-Verlag, New York, pp. 131-158.
20. Megiddo, N. and Schub, M. (1989). "Boundary behavior of interior point algorithms in linear programming", Mathematics of Operations Research, 14, 97-146.
21. Monteiro, R. and Adler, I. (1989). "Interior path following primal-dual algorithms. Part I: Linear Programming", Mathematical Programming, 44, 27-41.
22. Monteiro, R. and Tsuchiya, T. (1996). "Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem", Mathematics of Operations Research, 21, 129-148.
23. Monteiro, R. and Zhou, F. (1998). "On the existence and convergence of the central path for convex programming and some duality results", Computational Optimization and Applications, 10, 51-77.
24. Nesterov, Y. (1994). "Primal-dual methods", Seminar at CORE, Université Catholique de Louvain.
25. Overton, M.L. and Womersley, R.S. (1995). "Second derivatives for optimization eigenvalues of symmetric matrices", SIAM Journal on Matrix Analysis and Applications, 16, 697-718.
26. Parissot, G.R. (1961). "Résolution numérique approchée du problème de programation linéaire par application de la programation logarithmique", Revue Française Rechèrche Opérationelle, 20, 227-259.
27. Renegar, J. (1988). "A Polynomial-Time Algorithm Based on Newton's Method for Linear Programming", Mathematical Programming, 40, 59-94.
28. Rockafellar, R.T. (1970). Convex Analysis, Princeton University Press, New Jersey.
29. Shapiro, A. (1997). "First and second order analysis of nonlinear semidefinite programs", Mathematical Programming, 77, 301-320.
30. Shapiro, A. and Fan, M.K.H. (1995). "On eigenvalue optimization", SIAM Journal on Optimization, 5, 552-569.
31. Sonnevend, G. (1985). "An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming", In: Lecture Notes on Control and Information Sciences, 84, Springer-Verlag, New York, NY, 866-876.
32. Tarski, A. (1951). A Decission Method for Elementary Algebra and Geometry, Rand Coorporation, Berkeley and Los Angeles, (2nd edn.).
33. Vandenberghe, L. and Boyd, S. (1994). "Positive-definite programming". Mathematical Programming: State of the Art, Birge, J.R. and Murty, K.G.M. Eds., University of Michigan, Ann Arbor, MI, pp. 276-308.
34. Wilkie, A. (1996). "Model completeness results for expansions of the real field by restricted Pfaffian functions and the exponential function", J. AMS 9, pp. 1051-1094.