Article
Full entry |
PDF
(0.5 MB)
Feedback
PDF
(0.5 MB)
Feedback
Keywords:
semidefinite programming; central paths; penalty/barrier functions; Riemannian geometry; Cauchy trajectories
semidefinite programming; central paths; penalty/barrier functions; Riemannian geometry; Cauchy trajectories
Summary:
In this work, we study the properties of central paths, defined with respect to a large class of penalty and barrier functions, for convex semidefinite programs. The type of programs studied here is characterized by the minimization of a smooth and convex objective function subject to a linear matrix inequality constraint. So, it is a particular case of convex programming with conic constraints. The studied class of functions consists of spectrally defined functions induced by penalty or barrier maps defined over the real nonnegative numbers. We prove the convergence of the (primal, dual and primal-dual) central path toward a (primal, dual, primal-dual, respectively) solution of our problem. Finally, we prove the global existence of Cauchy trajectories in our context and we recall its relation with primal central path when linear semidefinite programs are considered. Some illustrative examples are shown at the end of this paper.
References:
[1] Alvarez, F., Bolte, J., Brahic, O.: Hessian Riemannian flows in convex programming. SIAM J. Control Optim. 43 (2004), 2, 477–501. DOI 10.1137/S0363012902419977 | MR 2086170
[2] Alvarez, F., López, J., C., H. Ramírez: Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and classification by hyperplanes. To appear in Optimization Methods and Software.
[3] Auslender, A., C., H. Ramírez: Penalty and barrier methods for convex semidefinite programming. Math. Methods Oper. Res. 43 (2006), 2, 195–219. MR 2264746
[4] Bayer, D. A., Lagarias, J. C.: The nonlinear geometry of linear programming I. Affine and projective scaling trajectories. Trans. Amer. Math. Soc. 314 (1989), 499–526. MR 1005525 | Zbl 0671.90045
[5] Neto, J. X. Cruz, Ferreira, O. P., Oliveira, P. R., Silva, R. C. M.: Central paths in semidefinite programming, generalized proximal point method and Cauchy trajectories in Riemannian manifolds. J. Optim. Theory Appl. 1 (2008), 1–16.
[6] Goemans, M. X.: Semidefinite programming in combinatorial optimization. Lectures on Mathematical Programming (ismp97). Math. Programming Ser. B 79 (1997), 1–3, 143–161. DOI 10.1007/BF02614315 | MR 1464765 | Zbl 0887.90139
[7] Dieudonné, J. A.: Foundations of Modern Analysis. Academic Press, New York 1969. MR 0349288 | Zbl 0708.46002
[8] Drummond, L. M. Graña, Peterzil, Y.: The central path in smooth convex semidefinite programming. Optimization 51 (2002), 207–233. DOI 10.1080/02331930290019396 | MR 1928037
[9] Halická, E., Klerk, E. de, Roos, C.: On the convergence of the central path in semidefinite optimization. SIAM J. Optim. 12 (2002), 4, 1090–1099. DOI 10.1137/S1052623401390793 | MR 1922510
[10] Iusem, A. N., Svaiter, B. F., Neto, J. X. da Cruz: Central paths, generalized proximal point methods and Cauchy trajectories in Riemannian manifolds. SIAM J. Control Optim. 37 (1999), 2, 566–588. DOI 10.1137/S0363012995290744 | MR 1670649
[11] Klerk, E. de: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. (Applied Optimization 65.) Kluwer Academic Publishers, Dordrecht 2002. MR 2064921 | Zbl 0991.90098
[12] Kojima, M., Shindoh, S., Hara, S.: Interior-point methods for the monotone semidefinite linear complementary problem in symmetic matrices. SIAM J. Optim. 7 (1997), 86–125. DOI 10.1137/S1052623494269035 | MR 1430559
[13] Lewis, A. S.: Convex Analysis on the Hermitian Matrices. SIAM J. Optim., 6 (1996), 1, 164–177. DOI 10.1137/0806009 | MR 1377729 | Zbl 0849.15013
[14] Lewis, A. S., Sendov, H. S.: Twice differentiable spectral functions. SIAM J. Matrix Anal. Appl. 23 (2001), 2, 368–386. DOI 10.1137/S089547980036838X | MR 1871318 | Zbl 1053.15004
[15] Lojasiewicz, S.: Ensembles Semi-analitiques. Inst. Hautes Études Sci., Bures-sur-Yvette 1965.
[16] Petersen, P.: Riemannian Geometry. Springer-Verlag, New York 1998. MR 1480173
[17] Seeger, A.: Convex analysis of spectrally defined matrix functions. SIAM J. Optim. 7 (1997), 679–696. DOI 10.1137/S1052623495288866 | MR 1462061 | Zbl 0890.15018
[18] Shapiro, A.: On Differentiability of Symmetric Matrix Valued Functions. Technical Report, School of Industrial and Systems Engineering, Georgia Institute of Technology, 2002.
[19] Todd, M.: Semidefinite optimization. Acta Numer. 10 (2001), 515–560. DOI 10.1017/S0962492901000071 | MR 2009698 | Zbl 1105.65334
[20] Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38 (1996), 1, 49–95. DOI 10.1137/1038003 | MR 1379041 | Zbl 1151.90512
Search
Partner of
