Central Paths in Semidefinite Programming, Generalized Proximal-Point Method and Cauchy Trajectories in Riemannian Manifolds

The relationships among the central path in the context of semidefinite programming, generalized proximal-point method and Cauchy trajectory in a Riemannian manifolds is studied in this paper. First, it is proved that the central path associated to a general function is well defined. The convergence and characterization of its limit point is established for functions satisfying a certain continuity property. Also, the generalized proximal-point method is considered and it is proved that the correspondingly generated sequence is contained in the central path. As a consequence, both converge to the same point. Finally, it is proved that the central path coincides with the Cauchy trajectory in a Riemannian manifold.

[1]  Tamás Rapcsák,et al.  Smooth Nonlinear Optimization in Rn , 1997 .

[2]  Zhi-Quan Luo,et al.  Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming , 1998, SIAM J. Optim..

[3]  Tamás Rapcsák,et al.  A class of polynomial variable metric algorithms for linear optimization , 1996, Math. Program..

[4]  Jonathan Eckstein,et al.  Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming , 1993, Math. Oper. Res..

[5]  Michael J. Todd,et al.  On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods , 2002, Found. Comput. Math..

[6]  Adrian S. Lewis,et al.  The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems , 2006, SIAM J. Optim..

[7]  O. P. Ferreira,et al.  Subgradient Algorithm on Riemannian Manifolds , 1998 .

[8]  Igor Griva,et al.  Interior-Point Methods for Linear Programming , 2009 .

[9]  C. Udriste,et al.  Convex Functions and Optimization Methods on Riemannian Manifolds , 1994 .

[10]  Osman Güler,et al.  Limiting behavior of weighted central paths in linear programming , 1994, Math. Program..

[11]  A. Iusem.  On Some Properties of Generalized Proximal Point Methods for Variational Inequalities , 1998 .

[12]  A. Forsgren,et al.  CHARACTERIZATION OF THE LIMIT POINT OF THE CENTRAL PATH IN SEMIDEFINITE PROGRAMMING , 2002 .

[13]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[14]  K. Kurdyka,et al.  Proof of the gradient conjecture of R. Thom , 1999, math/9906212.

[15]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[16]  David L. Jensen,et al.  The convergence of a modified barrier method for convex programming , 1994, IBM J. Res. Dev..

[17]  Marc Teboulle,et al.  Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions , 1993, SIAM J. Optim..

[18]  P. Roberto Oliveira,et al.  A new barrier for a class of semidefinite problems , 2006, RAIRO Oper. Res..

[19]  Roberto Cominetti,et al.  Asymptotic analysis of the exponential penalty trajectory in linear programming , 1994, Math. Program..

[20]  James Renegar,et al.  A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.

[21]  Y. Censor,et al.  On the proximal minimization algorithm with D-Functions , 1992 .

[22]  M. J. D. Powell,et al.  Some Convergence Properties of the Modified Log Barrier Method for Linear Programming , 1995, SIAM J. Optim..

[23]  Felipe Alvarez,et al.  Hessian Riemannian Gradient Flows in Convex Programming , 2018, SIAM J. Control. Optim..

[24]  O. P. Ferreira,et al.  Proximal Point Algorithm On Riemannian Manifolds , 2002 .

[25]  Gunnar Rätsch,et al.  Matrix Exponentiated Gradient Updates for On-line Learning and Bregman Projection , 2004, J. Mach. Learn. Res..

[26]  A. Friedman.  Foundations of modern analysis , 1970 .

[27]  Marc Teboulle,et al.  Nonlinear rescaling and proximal-like methods in convex optimization , 1997, Math. Program..

[28]  Héctor Ramírez Cabrera,et al.  Penalty and Barrier Methods for Convex Semidefinite Programming , 2006, Math. Methods Oper. Res..

[29]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[30]  Marc Teboulle,et al.  Interior Gradient and Proximal Methods for Convex and Conic Optimization , 2006, SIAM J. Optim..

[31]  A. Iusem,et al.  Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds , 1999 .

[32]  Etienne de Klerk,et al.  Limiting behavior of the central path in semidefinite optimization , 2005, Optim. Methods Softw..

[33]  Tibor Csendes,et al.  Some Global Optimization Problems on Stiefel Manifolds , 2004, J. Glob. Optim..

[34]  V. Prasolov.  Problems and theorems in linear algebra , 1994 .

[35]  Michael Shub,et al.  On the Curvature of the Central Path of Linear Programming Theory , 2003, Found. Comput. Math..

[36]  L. M. Graña Drummond,et al.  THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS , 2002 .

[37]  Leonid Mosheyev,et al.  Penalty/Barrier multiplier algorthm for semidefinit programming , 2000 .

[38]  Paul Tseng,et al.  On the convergence of the exponential multiplier method for convex programming , 1993, Math. Program..

[39]  João X. da Cruz Neto,et al.  Asymptotic behavior of the central path for a special class of degenerate SDP problems , 2005, Math. Program..

[40]  Marc Teboulle,et al.  An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming , 1998, SIAM J. Optim..

[41]  Alfredo N. Iusem,et al.  Dual convergence of the proximal point method with Bregman distances for linear programming , 2007, Optim. Methods Softw..

[42]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[43]  Yurii Nesterov,et al.  Central path and Riemannian distances , 2003 .

[44]  Etienne de Klerk,et al.  On the Convergence of the Central Path in Semidefinite Optimization , 2002, SIAM J. Optim..

[45]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[46]  Alfredo N. Iusem,et al.  On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances , 2000, Math. Oper. Res..