A unified proximal gradient method for nonconvex composite optimization with extrapolation

DOI10.3934/NACO.2024005MaRDI QIDQ6952981zbMATH OpenFDO

Authors Miao Zhang, Hongchao Zhang

Publication date 25 July 2025

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/NACO.2024005

zbMATH Keywords

accelerated gradient methodglobal and local linear convergencenonconvex composite optimizationnonsmooth optimizationoptimal convergence rateproximal gradient method

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)

Cites work

• A coordinate gradient descent method for nonsmooth separable minimization
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A unified formulation and fast accelerated proximal gradient method for classification
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Error bounds and convergence analysis of feasible descent methods: A general approach
• General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
• Generalized uniformly optimal methods for nonlinear programming
• Introductory lectures on convex optimization. A basic course.
• Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
• The elements of statistical learning. Data mining, inference, and prediction
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

This page was built for publication: A unified proximal gradient method for nonconvex composite optimization with extrapolation

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