Journal Home Page Cumulative Index List of all Volumes Complete Contentsof this Volume Previous Article Journal of Convex Analysis 17 (2010), No. 3&4, 701--720 Copyright Heldermann Verlag 2010 Convergence to the Optimal Value for Barrier Methods Combined with Hessian Riemannian Gradient Flows and Generalized Proximal Algorithms Felipe Alvarez Dep. de Ingeniería Matemática, Centro de Modelamiento Matemático, Universidad de Chile, Blanco Encalada 2120, Santiago, Chile falvarez@dim.uchile.cl Julio López Dep. de Ingeniería Matemática, Centro de Modelamiento Matemático, Universidad de Chile, Blanco Encalada 2120, Santiago, Chile jclopez@dim.uchile.cl [Abstract-pdf] \def\dom{{\rm dom}\:} \newcommand{\R}{{\mathbb R}} We consider the problem $\min_{x\in\R^n}\{f(x)\mid Ax=b, \ x\in \overline{C},\ g_j(x)\le0,\ j=1,\ldots,s\}$, where $b\in\R^m$, $A\in\R^{m\times n}$ is a full rank matrix, $\overline{C}$ is the closure of a nonempty, open and convex subset $C$ of $\R^n$, and $g_j(\cdot)$, $j=1,\ldots,s$, are nonlinear convex functions. Our strategy consists firstly in to introduce a barrier-type penalty for the constraints $g_j(x)\le0$, then endowing $\{x\in \R^n\mid Ax=b, x\in C\}$ with the Riemannian structure induced by the Hessian of an essentially smooth convex function $h$ such that $C=\hbox{int}(\dom h)$, and finally considering the flow generated by the Riemannian penalty gradient vector field. Under minimal hypotheses, we investigate the well-posedness of the resulting ODE and we prove that the value of the objective function along the trajectories, which are strictly feasible, converges to the optimal value. Moreover, the value convergence is extended to the sequences generated by an implicit discretization scheme which corresponds to the coupling of an inexact generalized proximal point method with parametric barrier schemes. Specializations and simple illustrations of the general results are given for the positive orthant, the unitary simplex and the second-order cone. [ Fulltext-pdf  (594  KB)] for subscribers only.