An iterative approach to a constrained least squares problem
From MaRDI portal
Publication:1811867
DOI10.1155/S1085337503212082zbMath1053.65041MaRDI QIDQ1811867
Publication date: 18 June 2003
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/51108
convergence; iterative algorithm; Hilbert space; Tikhonov regularization; least squares problem; minimum norm solution
65J10: Numerical solutions to equations with linear operators
65J20: Numerical solutions of ill-posed problems in abstract spaces; regularization
47A52: Linear operators and ill-posed problems, regularization
Related Items
Construction of Iterative Methods for Variational Inequality and Fixed Point Problems, On the strong convergence of a perturbed algorithm to the unique solution of a variational inequality problem, On the strong convergence of a general-type Krasnosel'skii-Mann's algorithm depending on the coefficients, New methods with perturbations for non-expansive mappings in Hilbert spaces, Computing the fixed points of strictly pseudocontractive mappings by the implicit and explicit iterations, Variant gradient projection methods for the minimization problems, Finding minimum norm fixed point of nonexpansive mappings and applications, On some Mann's type iterative algorithms, On the auxiliary mappings generated by a family of mappings and solutions of variational inequalities problems, Conversion of algorithms by releasing projection for minimization problems, On the role of the coefficients in the strong convergence of a general type Mann iterative scheme, A new computational technique for common solutions between systems of generalized mixed equilibrium and fixed point problems, Iterative Methods for Nonexpansive Mappings in Banach Spaces, Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications