Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
From MaRDI portal
Publication:2149955
DOI10.1007/s10589-022-00377-9zbMath1494.90086arXiv2007.11772OpenAlexW3043869225MaRDI QIDQ2149955
Renato D. C. Monteiro, WeiWei Kong
Publication date: 27 June 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.11772
iteration complexityspectral optimizationcomposite nonconvex problemfirst-order accelerated gradient methodinexact composite gradient method
Related Items
Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method, Average curvature FISTA for nonconvex smooth composite optimization problems
Uses Software
Cites Work
- Unnamed Item
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- An adaptive accelerated first-order method for convex optimization
- Gradient methods for minimizing composite functions
- A proximal difference-of-convex algorithm with extrapolation
- A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
- Generalized uniformly optimal methods for nonlinear programming
- Efficiency of minimizing compositions of convex functions and smooth maps
- An Accelerated HPE-Type Algorithm for a Class of Composite Convex-Concave Saddle-Point Problems
- Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity
- Accelerated Methods for NonConvex Optimization
- First-Order Methods in Optimization
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Phase Retrieval via Matrix Completion
