On the acceleration of forward-backward splitting via an inexact Newton method
From MaRDI portal
Publication:6309352
DOI10.1007/978-3-030-25939-6_15arXiv1811.02935MaRDI QIDQ6309352FDOQ6309352
Authors: Andreas Themelis, Masoud Ahookhosh, Panagiotis Patrinos 
Publication date: 7 November 2018
Abstract: We propose a Forward-Backward Truncated-Newton method (FBTN) for minimizing the sum of two convex functions, one of which smooth. Unlike other proximal Newton methods, our approach does not involve the employment of variable metrics, but is rather based on a reformulation of the original problem as the unconstrained minimization of a continuously differentiable function, the forward-backward envelope (FBE). We introduce a generalized Hessian for the FBE that symmetrizes the generalized Jacobian of the nonlinear system of equations representing the optimality conditions for the problem. This enables the employment of conjugate gradient method (CG) for efficiently solving the resulting (regularized) linear systems, which can be done inexactly. The employment of CG prevents the computation of full (generalized) Jacobians, as it requires only (generalized) directional derivatives. The resulting algorithm is globally (subsequentially) convergent, -linearly under an error bound condition, and up to -superlinearly and -quadratically under regularity assumptions at the possibly non-isolated limit point.
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Newton-type methods (49M15)
This page was built for publication: On the acceleration of forward-backward splitting via an inexact Newton method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6309352)
