New inertial relaxed method for solving split feasibilities (Q2047200)

From MaRDI portal

Revision as of 11:17, 26 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	New inertial relaxed method for solving split feasibilities	scientific article

Statements

scholarly article

0 references

New inertial relaxed method for solving split feasibilities (English)

0 references

0 references

0 references

Optimization Letters

0 references

publication date

19 August 2021

0 references

zbMATH Keywords

alternated inertial

0 references

CQ methods

0 references

split feasibility problems

0 references

signal processing

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11590-020-01603-1

0 references

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

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

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

Inertial Douglas-Rachford splitting for monotone inclusion problems

0 references

An inertial alternating direction method of multipliers

0 references

An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems

0 references

Iterative oblique projection onto convex sets and the split feasibility problem

0 references

A unified treatment of some iterative algorithms in signal processing and image reconstruction

0 references

A multiprojection algorithm using Bregman projections in a product space

0 references

The multiple-sets split feasibility problem and its applications for inverse problems

0 references

An iterative row-action method for interval convex programming

0 references

Perturbed projections and subgradient projections for the multiple-sets split feasibility problem

0 references

Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications

0 references

The strong convergence of a KM–CQ-like algorithm for a split feasibility problem

0 references

Inertial accelerated algorithms for solving a split feasibility problem

0 references

Double projection algorithms for solving the split feasibility problems

0 references

``Optimal'' choice of the step length of the projection and contraction methods for solving the split feasibility problem

0 references

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

0 references

A relaxed projection method for variational inequalities

0 references

Note on the modified relaxation CQ algorithm for the split feasibility problem

0 references

0 references

Matrix <i>p</i>-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$

0 references

A generic online acceleration scheme for optimization algorithms via relaxation and inertia

0 references

On the proximal gradient algorithm with alternated inertia

0 references

Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces

0 references

Solving the split feasibility problem without prior knowledge of matrix norms

0 references

An inertial forward-backward algorithm for monotone inclusions

0 references

Inertial iterative process for fixed points of certain quasi-nonexpansive mappings

0 references

A First-Order Primal-Dual Algorithm with Linesearch

0 references

Convergence of a splitting inertial proximal method for monotone operators

0 references

Accelerated alternating minimization algorithm for Poisson noisy image recovery

0 references

0 references

A projected subgradient-proximal method for split equality equilibrium problems of pseudomonotone bifunctions in Banach spaces

0 references

Some methods of speeding up the convergence of iteration methods

0 references

A note on the <i>CQ</i> algorithm for the split feasibility problem

0 references

An iterative regularization method for the solution of the split feasibility problem in Banach spaces

0 references

0 references

An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces

0 references

A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems

0 references

Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method

0 references

Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems

0 references

0 references

Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces

0 references

The relaxed CQ algorithm solving the split feasibility problem

0 references

0 references

The ball-relaxed CQ algorithms for the split feasibility problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s11590-020-01603-1

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2047200

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