A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems

DOI10.1007/s10589-021-00280-9zbMath1473.90130arXiv1905.07010OpenAlexW3163829762MaRDI QIDQ2044494

Renato D. C. Monteiro, Jiaming Liang, Chee-Khian Sim

Publication date: 9 August 2021

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.07010

zbMATH Keywords

iteration-complexity, accelerated composite gradient

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)

Related Items

Accelerated inexact composite gradient methods for nonconvex spectral optimization problems, An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems, Average curvature FISTA for nonconvex smooth composite optimization problems

Uses Software

• NC-OPT

Cites Work

• Unnamed Item
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• Gradient methods for minimizing composite functions
• Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
• Generalized uniformly optimal methods for nonlinear programming
• Efficiency of minimizing compositions of convex functions and smooth maps
• An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
• Accelerating Block-Decomposition First-Order Methods for Solving Composite Saddle-Point and Two-Player Nash Equilibrium Problems
• An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
• New Proximal Point Algorithms for Convex Minimization
• Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity
• Accelerated Methods for NonConvex Optimization
• An accelerated non-Euclidean hybrid proximal extragradient-type algorithm for convex–concave saddle-point problems
• An Average Curvature Accelerated Composite Gradient Method for Nonconvex Smooth Composite Optimization Problems
• Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
• Optimal Primal-Dual Methods for a Class of Saddle Point Problems
• An Accelerated Linearized Alternating Direction Method of Multipliers