New Self-Concordant Barrier for the Hypercube

Abstract We introduce a new barrier function to build new interior-point algorithms to solve optimization problems with bounded variables. First, we show that this function is a (3/2)n-self-concordant barrier for the unitary hypercube [0,1]n, assuring thus the polynomial property of related algorithms. Second, using the Hessian metric of that barrier, we present new explicit algorithms from the point of view of Riemannian geometry applications. Third, we prove that the central path defined by the new barrier to solve a certain class of linearly constrained convex problems maintains most of the properties of the central path defined by the usual logarithmic barrier. We present also a primal long-step path-following algorithm with similar complexity to the classical barrier. Finally, we introduce a new proximal-point Bregman type algorithm to solve linear problems in [0,1]n and prove its convergence.

[1]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

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

[3]  A. Ruszczynski,et al.  Nonlinear Optimization , 2006 .

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

[5]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

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

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

[8]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

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

[10]  Dick den Hertog,et al.  Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity , 1994 .

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

[12]  I. Holopainen.  Riemannian Geometry , 1927, Nature.

[13]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

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

[15]  C. Roos,et al.  Inverse barrier methods for linear programming , 1994 .

[16]  C. Roos,et al.  Inverse barrier methods for linear programming Report 91-27 , 1991 .

[17]  Roman A. Polyak,et al.  Modified barrier functions (theory and methods) , 1992, Math. Program..

[18]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .