Log In Sign Up

Generalized Self-concordant Hessian-barrier algorithms

by   Pavel Dvurechensky, et al.

Many problems in statistical learning, imaging, and computer vision involve the optimization of a non-convex objective function with singularities at the boundary of the feasible set. For such challenging instances, we develop a new interior-point technique building on the Hessian-barrier algorithm recently introduced in Bomze, Mertikopoulos, Schachinger and Staudigl, [SIAM J. Opt. 2019 29(3), pp. 2100-2127], where the Riemannian metric is induced by a generalized self-concordant function. This class of functions is sufficiently general to include most of the commonly used barrier functions in the literature of interior point methods. We prove global convergence to an approximate stationary point of the method, and in cases where the feasible set admits an easily computable self-concordant barrier, we verify worst-case optimal iteration complexity of the method. Applications in non-convex statistical estimation and L^p-minimization are discussed to given the efficiency of the method.


page 1

page 2

page 3

page 4


The entropic barrier is n-self-concordant

For any convex body K ⊆ℝ^n, S. Bubeck and R. Eldan introduced the entrop...

Hessian barrier algorithms for linearly constrained optimization problems

In this paper, we propose an interior-point method for linearly constrai...

A Stochastic Trust Region Method for Non-convex Minimization

We target the problem of finding a local minimum in non-convex finite-su...

No self-concordant barrier interior point method is strongly polynomial

It is an open question to determine if the theory of self-concordant bar...

Quasi-Newton Steps for Efficient Online Exp-Concave Optimization

The aim of this paper is to design computationally-efficient and optimal...

Interior Point Methods with Adversarial Networks

We present a new methodology, called IPMAN, that combines interior point...

Dual perspective method for solving the point in a polygon problem

A novel method has been introduced to solve a point inclusion in a polyg...