Results 51 to 60 of about 160 (66)

The regularized CQ algorithm without a priori knowledge of operator norm for solving the split feasibility problem. [PDF]

J Inequal Appl, 2017
Tian M, Zhang HF.
europepmc   +1 more source

Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem. [PDF]

J Inequal Appl, 2017
Tian M, Zhang HF.
europepmc   +1 more source

Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces. [PDF]

J Inequal Appl, 2018
Yu H, Wang F.
europepmc   +1 more source

An optimal adaptive wavelet method for first order system least squares. [PDF]

Numer Math (Heidelb), 2018
Rekatsinas N, Stevenson R.
europepmc   +1 more source

Weak convergence theorem for a class of split variational inequality problems and applications in a Hilbert space. [PDF]

J Inequal Appl, 2017
Tian M, Jiang BN.
europepmc   +1 more source

Runge-Kutta time semidiscretizations of semilinear PDEs with non-smooth data. [PDF]

Numer Math (Heidelb), 2016
Wulff C, Evans C.
europepmc   +1 more source

Solving a system of nonlinear integral equations and existence of asymptotically stable solutions

, 2012
L. Ngoc, N. Long
semanticscholar   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Some comments on the recent results of Kraikaew and Saejung concerning solutions of the split common fixed point problem

, 2021
We consider the results of R. Kraikaew and S. Saejung (Another Look at Wang’s New Method For Solving Split Common Fixed-Point Problems Without Priori Knowledge of Operator Norms, J.
B. Akuchu, K. T. Nwigbo
semanticscholar   +1 more source

Weak and Strong Convergence of Two Algorithms for the Split Fixed Point Problem

Numerical Mathematics: Theory, Methods and Applications, 2018
Two iterative algorithms are proposed for the split fixed point problem. The first algorithm is shown to be weakly convergent and the second one to be strongly convergent.
Feng Xu
semanticscholar   +1 more source

Weakly Picard mappings: Retraction-displacement condition, quasicontraction notion and weakly Picard admissible perturbation

Studia Universitatis Babeş-Bolyai. Mathematica
Let (X, d) be a metric space, f : X → X be a mapping and G(·, f (·)) be an admissible perturbation of f. In this paper we study the following problems: In which conditions imposed on f and G we have the following: (DDE) data dependence estimate for the ...
I. Rus
semanticscholar   +1 more source