New inertial proximal gradient methods for unconstrained convex optimization problems
From MaRDI portal
Recommendations
- Double inertial proximal gradient algorithms for convex optimization problems and applications
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
- New inertial forward-backward algorithm for convex minimization with applications
- An inertial proximal-gradient penalization scheme for constrained convex optimization problems
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
Cites work
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 47597 (Why is no real title available?)
- scientific article; zbMATH DE number 3187170 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia
- A regularized algorithm for the proximal split feasibility problem
- Averaged mappings and the gradient-projection algorithm
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- Bounded perturbation resilience of projected scaled gradient methods
- Bounded perturbation resilience of the viscosity algorithm
- General viscosity iterative approximation for solving unconstrained convex optimization problems
- New inertial relaxed method for solving split feasibilities
- Perturbation resilience and superiorization of iterative algorithms
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Properties and iterative methods for the \(Q\)-lasso
- Properties and iterative methods for the lasso and its variants
- Proximity algorithms for image models: denoising
- Solving the variational inequality problem defined on intersection of finite level sets
- Some methods of speeding up the convergence of iteration methods
- Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm
- Strong convergence of a proximal point algorithm with bounded error sequence
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
Cited in
(14)- On the proximal gradient algorithm with alternated inertia
- An inertial proximal-gradient penalization scheme for constrained convex optimization problems
- scientific article; zbMATH DE number 7267094 (Why is no real title available?)
- iPiano: inertial proximal algorithm for nonconvex optimization
- Inertial proximal gradient method using adaptive stepsize for convex minimization problems
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
- Inertial proximal point regularization algorithm for unconstrained vector convex optimization problems
- Theoretical aspect of diagonal Bregman proximal methods
- Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems
- Double inertial proximal gradient algorithms for convex optimization problems and applications
- New inertial self-adaptive algorithms for the split common null-point problem: application to data classifications
- Inertial self-adaptive algorithms for solving non-smooth convex optimization problems
- A new proximal heavy ball inexact line-search algorithm
- An inexact proximal regularization method for unconstrained optimization
This page was built for publication: New inertial proximal gradient methods for unconstrained convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2069605)
