Convexly constrained linear inverse problems: iterative least-squares and regularization

DOI10.1109/78.709518zbMath0978.93085OpenAlexW2158065297MaRDI 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

zbMATH Keywords

stopping ruleconvex constraintsminimum norm least squares solutionill-posed linear problemsconstrained Laplace inversionrobust inversion of linear operators

Mathematics Subject Classification ID

Least squares and related methods for stochastic control systems (93E24) Numerical solutions to equations with linear operators (65J10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20)

Related Items (28)

Parallel algorithms for variational inclusions and fixed points with applications ⋮ An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING ⋮ 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 ⋮ An extragradient method for finding minimum-norm solution of the split equilibrium problem ⋮ Fast self-adaptive regularization iterative algorithm for solving split feasibility problem ⋮ An implicit extragradient method for hierarchical variational inequalities ⋮ A regularized gradient projection method for the minimization problem ⋮ Iterative schemes for fixed point computation of nonexpansive mappings ⋮ Regularized algorithms for hierarchical fixed-point problems ⋮ Computing the fixed points of strictly pseudocontractive mappings by the implicit and explicit iterations ⋮ Variant gradient projection methods for the minimization problems ⋮ 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 ⋮ Construction of Iterative Methods for Variational Inequality and Fixed Point Problems ⋮ 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 modified Korpelevich's method convergent to the minimum-norm solution of a variational inequality ⋮ A projection method for bilevel variational inequalities ⋮ Finding minimum norm fixed point of nonexpansive mappings and applications ⋮ Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings ⋮ Strong convergence theorem for the lexicographic Ky Fan inequality ⋮ Iterative methods for finding minimum-norm fixed points of nonexpansive mappings with applications ⋮ On the convergence of splitting algorithm for mixed equilibrium problems on Hadamard manifolds ⋮ Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions

This page was built for publication: Convexly constrained linear inverse problems: iterative least-squares and regularization