General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
From MaRDI portal
Publication:2419543
DOI10.1007/s10589-019-00073-1zbMath1420.90054OpenAlexW2916621068MaRDI QIDQ2419543
Publication date: 13 June 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00073-1
Related Items
An inertial proximal alternating direction method of multipliers for nonconvex optimization, Convergence of inexact quasisubgradient methods with extrapolation, A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems, Nonconvex optimization with inertial proximal stochastic variance reduction gradient, Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems, Double inertial parameters forward-backward splitting method: Applications to compressed sensing, image processing, and SCAD penalty problems, A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems, Convergence analysis of modified inertial forward–backward splitting scheme with applications, A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems, Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization, A forward-backward algorithm with different inertial terms for structured non-convex minimization problems, An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems, Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem, Global optimization for non-convex programs via convex proximal point method, Accelerated stochastic variance reduction for a class of convex optimization problems, Unnamed Item, A general inertial projected gradient method for variational inequality problems, Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems, Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems, An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing, An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems, An inertial proximal partially symmetric ADMM-based algorithm for linearly constrained multi-block nonconvex optimization problems with applications, Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
Uses Software
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Gradient methods for minimizing composite functions
- Sparse solutions to random standard quadratic optimization problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Convergence of one-step projected gradient methods for variational inequalities
- An inertial forward-backward algorithm for monotone inclusions
- iPiasco: inertial proximal algorithm for strongly convex optimization
- A coordinate gradient descent method for nonsmooth separable minimization
- On gradients of functions definable in o-minimal structures
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Introductory lectures on convex optimization. A basic course.
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions
- Convergence of a splitting inertial proximal method for monotone operators
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- DC programming: overview.
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Proximal Splitting Methods in Signal Processing
- 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
- Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Convergence Rates in Forward--Backward Splitting
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- On the Minimizing Property of a Second Order Dissipative System in Hilbert Spaces
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Convex Optimization in Signal Processing and Communications
- A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Proximal-gradient algorithms for fractional programming
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- Compressed sensing
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
