Forward-backward truncated Newton methods for convex composite optimization
From MaRDI portal
Publication:6249359
Abstract: This paper proposes two proximal Newton-CG methods for convex nonsmooth optimization problems in composite form. The algorithms are based on a a reformulation of the original nonsmooth problem as the unconstrained minimization of a continuously differentiable function, namely the forward-backward envelope (FBE). The first algorithm is based on a standard line search strategy, whereas the second one combines the global efficiency estimates of the corresponding first-order methods, while achieving fast asymptotic convergence rates. Furthermore, they are computationally attractive since each Newton iteration requires the approximate solution of a linear system of usually small dimension.
This page was built for publication: Forward-backward truncated Newton methods for convex composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6249359)
