Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing (Q2173332): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 09:00, 31 July 2024

scientific article

Language	Label	Description	Also known as
English	Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing	scientific article

Statements

scholarly article

0 references

Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing (English)

0 references

0 references

Olaniyi Samuel Iyiola

0 references

Ferdinard Udochukwu Ogbuisi

0 references

Numerical Algorithms

0 references

publication date

22 April 2020

0 references

zbMATH Keywords

Halpern-type algorithm

0 references

inertial terms

0 references

nonexpansive mappings

0 references

strong convergence

0 references

Hilbert spaces

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11075-019-00727-5

0 references

Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space

0 references

An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping

0 references

Vector Variational Inequalities and Vector Optimization

0 references

The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$

0 references

0 references

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Lectures on Modern Convex Optimization

0 references

Four parameter proximal point algorithms

0 references

Inducing strong convergence into the asymptotic behaviour of proximal splitting algorithms in Hilbert spaces

0 references

0 references

On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm''

0 references

A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration

0 references

Atomic Decomposition by Basis Pursuit

0 references

Iterative approximation of fixed points of nonexpansive mappings

0 references

An inertial forward-backward splitting method for solving inclusion problems in Hilbert spaces

0 references

Signal Recovery by Proximal Forward-Backward Splitting

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions

0 references

Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings

0 references

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

0 references

0 references

Fixed points of nonexpanding maps

0 references

Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation

0 references

Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems

0 references

Generalized Krasnoselskii-Mann-type iterations for nonexpansive mappings in Hilbert spaces

0 references

Strong convergence of a double projection-type method for monotone variational inequalities in Hilbert spaces

0 references

Halpern type iterations for strongly quasi-nonexpansive sequences and its applications

0 references

0 references

Combined relaxation methods for variational inequalities

0 references

0 references

Strong convergence of the Halpern subgradient extragradient method for solving variational inequalities in Hilbert spaces

0 references

On split common fixed point problems

0 references

0 references

0 references

An inertial forward-backward algorithm for monotone inclusions

0 references

Constructing Test Instances for Basis Pursuit Denoising

0 references

Approximation methods for common fixed points of nonexpansive mappings in Hilbert spaces

0 references

Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization

0 references

Convergence of one-step projected gradient methods for variational inequalities

0 references

Projected Reflected Gradient Methods for Monotone Variational Inequalities

0 references

Convergence of generalized proximal point algorithms

0 references

Proximity algorithms for image models: denoising

0 references

Convergence of a splitting inertial proximal method for monotone operators

0 references

Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups.

0 references

Some methods of speeding up the convergence of iteration methods

0 references

0 references

A Generalized Forward-Backward Splitting

0 references

Strong convergence theorems for resolvents of accretive operators in Banach spaces

0 references

Some problems and results in fixed point theory

0 references

Halpern's iteration in Banach spaces

0 references

Iterative approximations for zeros of sum of accretive operators in Banach spaces

0 references

Strong convergence result of forward-backward splitting methods for accretive operators in Banach spaces with applications

0 references

Strong convergence of approximated sequences for nonexpansive mappings in Banach spaces

0 references

Strong convergence of Krasnoselskii and Mann's type sequences for one-parameter nonexpansive semigroups without Bochner integrals

0 references

0 references

On the contraction-proximal point algorithms with multi-parameters

0 references

Error sensitivity for strongly convergent modifications of the proximal point algorithm

0 references

0 references

Approximation of fixed points of nonexpansive mappings

0 references

Iterative Algorithms for Nonlinear Operators

0 references

Another control condition in an iterative method for nonexpansive mappings

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s11075-019-00727-5

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2173332

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2173332&oldid=37481638"