Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems
From MaRDI portal
Publication:2156917
DOI10.1007/s00500-020-05038-9zbMath1491.90123OpenAlexW3034916370MaRDI QIDQ2156917
Publication date: 21 July 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-020-05038-9
convex optimizationmaximal monotone operatorfixed-point algorithmnonexpansiveproximal gradient methodfixed-point setLasso problems-iteration method
Related Items (3)
Parallel Normal S-Iteration Methods with Applications to Optimization Problems ⋮ New acceleration factors of the Krasnosel'skiĭ-Mann iteration ⋮ A new splitting method for systems of monotone inclusions in Hilbert spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- Convergence rates with inexact non-expansive operators
- Comments on ``The proximal point algorithm revisited
- The prox-Tikhonov-like forward-backward method and applications
- A comparison between iterative methods by using the basins of attraction
- Application of a new accelerated algorithm to regression problems
- Convergence theorems for inertial KM-type algorithms
- A multiprojection algorithm using Bregman projections in a product space
- An inertial method for solving split common fixed point problems
- Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations
- On the rate of convergence of Krasnosel'skiĭ-Mann iterations and their connection with sums of Bernoullis
- A new iteration technique for nonlinear operators as concerns convex programming and feasibility problems
- An iterative method and its application to stable inversion
- Split common fixed point problems for demicontractive operators
- Strong convergence theorem for a finite family of demimetric mappings with variational inequality problems in a Hilbert space
- Inertial accelerated algorithms for solving a split feasibility problem
- A new iteration method for variational inequalities on the set of common fixed points for a finite family of quasi-pseudocontractions in Hilbert spaces
- Variable KM-like algorithms for fixed point problems and split feasibility problems
- Rates of convergence for inexact Krasnosel'skii-Mann iterations in Banach spaces
- MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
- A Picard-Mann hybrid iterative process
- Convergence of Inexact Mann Iterations Generated by Nearly Nonexpansive Sequences and Applications
- The multiple-sets split feasibility problem and its applications for inverse problems
- The split common fixed-point problem for demicontractive mappings
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The Split Common Null Point Problem
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Weak and Strong Convergence Theorems for New Demimetric Mappings and the Split Common Fixed Point Problem in Banach Spaces
- On Projection Algorithms for Solving Convex Feasibility Problems
- ON THE CONVERGENCE RATE OF THE KRASNOSEL’SKIĬ–MANN ITERATION
- Some Iterative Methods for Fixed Point Problems
- Convergence Rate Analysis of Several Splitting Schemes
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Signal Recovery by Proximal Forward-Backward Splitting
- Fixed Point Theory for Lipschitzian-type Mappings with Applications
- Some methods of speeding up the convergence of iteration methods
- Mean Value Methods in Iteration
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems
