A proximal gradient method with double inertial steps for minimization problems involving demicontractive mappings
From MaRDI portal
Publication:6609596
DOI10.1186/S13660-024-03145-XzbMATH Open1546.90294MaRDI QIDQ6609596FDOQ6609596
Authors: T. Mouktonglang, Wipawinee Chaiwino, Raweerote Suparatulatorn 
Publication date: 24 September 2024
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Title not available (Why is that?)
- Convex analysis and monotone operator theory in Hilbert spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- A logarithmic-quadratic proximal method for variational inequalities
- Mean Value Methods in Iteration
- Convergence theorems for inertial KM-type algorithms
- Fixed points of nonlinear operators. Iterative methods
- Regularization, optimization, kernels, and support vector machines
- Weak convergence of iterative methods for solving quasimonotone variational inequalities
- General inertial Mann algorithms and their convergence analysis for nonexpansive mappings
- Generating Nesterov's accelerated gradient algorithm by using optimal control theory for optimization
- Forward-backward-forward algorithms involving two inertial terms for monotone inclusions
- A parallel method for common variational inclusion and common fixed point problems with applications
- Nesterov's acceleration for level set-based topology optimization using reaction-diffusion equations
- Inertial proximal gradient method using adaptive stepsize for convex minimization problems
This page was built for publication: A proximal gradient method with double inertial steps for minimization problems involving demicontractive mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609596)
