Convexly constrained linear inverse problems: iterative least-squares and regularization
From MaRDI portal
Publication:2724264
DOI10.1109/78.709518zbMath0978.93085MaRDI QIDQ2724264
Ashutosh Sabharwal, Lee C. Potter
Publication date: 12 February 2002
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cd3d1b508cf2e08f550f0869b063355a2cc082b3
stopping rule; convex constraints; minimum norm least squares solution; ill-posed linear problems; constrained Laplace inversion; robust inversion of linear operators
93E24: Least squares and related methods for stochastic control systems
65J10: Numerical solutions to equations with linear operators
65J20: Numerical solutions of ill-posed problems in abstract spaces; regularization
Related Items
NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING, Hybrid Moreau’s Proximal Algorithms and Convergence Theorems for Minimization Problems in Hilbert Spaces with Applications, Algorithms and Convergence Theorems for Mixed Equilibrium Problems in Hilbert Spaces, Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings, Construction of Iterative Methods for Variational Inequality and Fixed Point Problems, A modified Korpelevich's method convergent to the minimum-norm solution of a variational inequality, Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions, Parallel algorithms for variational inclusions and fixed points with applications, An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem, A regularized gradient projection method for the minimization problem, Iterative schemes for fixed point computation of nonexpansive mappings, 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, An implicit extragradient method for hierarchical variational inequalities, Regularized algorithms for hierarchical fixed-point problems, Strong convergence theorem for the lexicographic Ky Fan inequality, An extragradient method for finding minimum-norm solution of the split equilibrium problem, Fast self-adaptive regularization iterative algorithm for solving split feasibility problem, Conversion of algorithms by releasing projection for minimization problems, Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces, Variant extragradient-type method for monotone variational inequalities, A projection method for bilevel variational inequalities, On the convergence of splitting algorithm for mixed equilibrium problems on Hadamard manifolds, On bilevel split pseudomonotone variational inequality problems with applications, A strongly convergent subgradient extragradient-Halpern method for solving a class of bilevel pseudomonotone variational inequalities, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications
