Hessian barrier algorithms for linearly constrained optimization problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Optimization Year : 2019

Hessian barrier algorithms for linearly constrained optimization problems


In this paper, we propose an interior-point method for linearly constrained-and possibly nonconvex-optimization problems. The method-which we call the Hessian barrier algorithm (HBA)-combines a forward Euler discretization of Hessian-Riemannian gradient flows with an Armijo backtracking step-size policy. In this way, HBA can be seen as an alternative to mirror descent, and contains as special cases the affine scaling algorithm, regularized Newton processes, and several other iterative solution methods. Our main result is that, modulo a nondegeneracy condition, the algorithm converges to the problem's critical set; hence, in the convex case, the algorithm converges globally to the problem's minimum set. In the case of linearly constrained quadratic programs (not necessarily convex), we also show that the method's convergence rate is $O(1/k^\rho)$ for some $\rho \in (0, 1]$ that depends only on the choice of kernel function (i.e., not on the problem's primi-tives). These theoretical results are validated by numerical experiments in standard nonconvex test functions and large-scale traffic assignment problems.
Fichier principal
Vignette du fichier
MainHBALinear.pdf (2.22 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02403531 , version 1 (11-12-2019)



Immanuel M Bomze, Panayotis Mertikopoulos, Werner Schachinger, Mathias Staudigl. Hessian barrier algorithms for linearly constrained optimization problems. SIAM Journal on Optimization, 2019, 29, pp.2100 - 2127. ⟨10.1137/18M1215682⟩. ⟨hal-02403531⟩
28 View
188 Download



Gmail Facebook Twitter LinkedIn More