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

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.

arXiv admin note: text overlap with arXiv:1802.03504

References in corpus (4)

• The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than $1/k^2$
• Catalyst Acceleration for Gradient-Based Non-Convex Optimization
• Generalized Uniformly Optimal Methods for Nonlinear Programming
• Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs

Cited by in corpus (6)

• A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
• An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems
• Accelerated Inexact First-Order Methods for Solving Nonconvex Composite Optimization Problems
• An Accelerated Inexact Dampened Augmented Lagrangian Method for Linearly-Constrained Nonconvex Composite Optimization Problems
• A FISTA-Type First Order Algorithm on Composite Optimization Problems that is Adaptable to the Convex Situation
• Average Curvature FISTA for Nonconvex Smooth Composite Optimization Problems