Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems

DOI10.1007/s10957-023-02348-4arXiv1711.06831OpenAlexW4389942280MaRDI QIDQ6182324

No author found.

Publication date: 25 January 2024

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

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

zbMATH Keywords

extrapolationstationary pointline searchproximal gradient methodnon-monotoneKL property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Nearly unbiased variable selection under minimax concave penalty
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Accelerated gradient methods for nonconvex nonlinear and stochastic programming
• A proximal method for composite minimization
• Gradient methods for minimizing composite functions
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• Smoothing methods for nonsmooth, nonconvex minimization
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Introductory lectures on convex optimization. A basic course.
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• A proximal difference-of-convex algorithm with extrapolation
• Templates for convex cone problems with applications to sparse signal recovery
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Asymptotics for Lasso-type estimators.
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
• Adaptive restart for accelerated gradient schemes
• Further properties of the forward-backward envelope with applications to difference-of-convex programming
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
• Asymptotic properties of bridge estimators in sparse high-dimensional regression models
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
• Proximal Splitting Methods in Signal Processing
• Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
• Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• A generalized proximal point algorithm for certain non-convex minimization problems
• Variational Analysis
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems
• Sparse Reconstruction by Separable Approximation
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms
• Minimization of $\ell_{1-2}$ for Compressed Sensing
• Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
• Group sparse optimization via $\ell_{p,q}$ regularization
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
• An introduction to continuous optimization for imaging
• Penalty Methods for a Class of Non-Lipschitz Optimization Problems
• On the nonmonotone line search

This page was built for publication: Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems