On the proximal gradient algorithm with alternated inertia
From MaRDI portal
Publication:1752647
DOI10.1007/s10957-018-1226-4OpenAlexW2963431706MaRDI QIDQ1752647
Franck Iutzeler, Jérôme Malick
Publication date: 24 May 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.05589
Related Items
Convergence analysis of new inertial method for the split common null point problem, An alternated inertial method for pseudomonotone variational inequalities in Hilbert spaces, Fast alternated inertial projection algorithms for pseudo-monotone variational inequalities, An alternated inertial general splitting method with linearization for the split feasibility problem, A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression, Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems, Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence, Alternated inertial algorithms for split feasibility problems, Convergence rate of a relaxed inertial proximal algorithm for convex minimization, Relaxed single projection methods for solving bilevel variational inequality problems in Hilbert spaces, Alternated inertial subgradient extragradient method for equilibrium problems, Global and linear convergence of alternated inertial methods for split feasibility problems, Unnamed Item, Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions, On the interplay between acceleration and identification for the proximal gradient algorithm, New inertial relaxed method for solving split feasibilities, An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- An inertial forward-backward algorithm for monotone inclusions
- Convergence theorems for inertial KM-type algorithms
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Convergence of some algorithms for convex minimization
- From error bounds to the complexity of first-order descent methods for convex functions
- Descentwise inexact proximal algorithms for smooth optimization
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
- New Proximal Point Algorithms for Convex Minimization
- Variational Analysis
- Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage
- A First-Order Primal-Dual Algorithm with Linesearch
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Nonconvex Sparse Regularization and Splitting Algorithms
- 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
- Convex analysis and monotone operator theory in Hilbert spaces
