A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems

arXiv1811.11378MaRDI QIDQ6310337FDOQ6310337

Authors: Jiaming Liang, Renato D. C. Monteiro 

Publication date: 27 November 2018

Abstract: This paper describes and establishes the iteration-complexity of a doubly accelerated inexact proximal point (D-AIPP) method for solving the nonconvex composite minimization problem whose objective function is of the form $f+h$ where $f$ is a (possibly nonconvex) differentiable function whose gradient is Lipschitz continuous and $h$ is a closed convex function with bounded domain. D-AIPP performs two types of iterations, namely, inner and outer ones. Its outer iterations correspond to the ones of the accelerated inexact proximal point scheme. Its inner iterations are the ones performed by an accelerated composite gradient method for inexactly solving the convex proximal subproblems generated during the outer iterations. Thus, D-AIPP employs both inner and outer accelerations.

This page was built for publication: A Doubly Accelerated Inexact Proximal Point Method for Nonconvex Composite Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6310337)