Iteration methods for convexly constrained ill-posed problems in hilbert space
From MaRDI portal
The author deals with minimizing a quadratic objective functional \(f \to \| Af - g\|^ 2\) over a closed convex constraint set \(C\), where \(A\) is a bounded linear operator. When the minimum is not unique, the author's suggestion is to look for the solution of minimal norm. In case the problem is ill-posed, i.e. the solution does not depend continuously on the data, then the problem can be solved by means of the Tikhonov- Phillips iterative regularization method. The regularities of three iterative methods, which are the projected Landweber iteration, the method of smooth solutions, and the damped projected Landweber iteration, are the main issue of this paper. Finally, the author applies these methods to specific problems and gives numerical results.
Recommendations
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
- Iterative methods for solving ill-posed problems with a priori information in Hilbert spaces
- Regularization of ill-posed constrained minimization problems by iteration methods
- scientific article; zbMATH DE number 4069628
- Iterative methods for ill-posed problems and semiconvergent sequences
- Iterative methods for fixed point problems in Hilbert spaces
- An iterative method to compute minimum norm solutions of ill-posed problems in Hilbert spaces
- scientific article; zbMATH DE number 30178
- scientific article; zbMATH DE number 5310524
Cites work
- A practical guide to splines
- An a posteriori parameter choice for Tikhonov regularization in the presence of modeling error
- Constrained \(L_ p\) approximation
- Duality and well-posedness in convex interpolation∗)
- scientific article; zbMATH DE number 3975692 (Why is no real title available?)
- scientific article; zbMATH DE number 4011018 (Why is no real title available?)
- scientific article; zbMATH DE number 4046977 (Why is no real title available?)
- scientific article; zbMATH DE number 41289 (Why is no real title available?)
- scientific article; zbMATH DE number 50171 (Why is no real title available?)
- scientific article; zbMATH DE number 3414220 (Why is no real title available?)
- Iterative methods for solving ill-posed problems with a priori information in Hilbert spaces
- Nonconvergence results for the application of least-squares estimation to ill-posed problems
- Random products of contractions in metric and Banach spaces
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- The instability of some gradient methods for ill-posed problems
- The solution by iteration of nonlinear functional equations in Banach spaces
- Tikhonov-regularization of ill-posed linear operator equations on closed convex sets
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(90)- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space
- Operator-theoretic and regularization approaches to ill-posed problems
- The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems
- On the split feasibility problem and fixed point problem of quasi--nonexpansive mapping in Banach spaces
- An iterative approach to a constrained least squares problem
- Some modified extragradient methods for solving split feasibility and fixed point problems
- Weak convergence theorem for finding fixed points and solution of split feasibility and systems of equilibrium problems
- An iterative algorithm for fixed point problem and convex minimization problem with applications
- Two new non-negativity preserving iterative regularization methods for ill-posed inverse problems
- New iterative regularization methods for solving split variational inclusion problems
- Iterative regularization for constrained minimization formulations of nonlinear inverse problems
- Convergence rates of a dual gradient method for constrained linear ill-posed problems
- Iterative Fejér processes in ill-posed problems
- Family constraining of iterative algorithms
- The Yosida approximation iterative technique for split monotone Yosida variational inclusions
- Relaxed and hybrid viscosity methods for general system of variational inequalities with split feasibility problem constraint
- The application of an oblique-projected Landweber method to a model of supervised learning
- An analysis of a multi-level projected steepest descent iteration for nonlinear inverse problems in Banach spaces subject to stability constraints
- New algorithms designed for the split common fixed point problem of quasi-pseudocontractions
- Damped projection method for split common fixed point problems
- Dual descent regularization algorithms in variable exponent Lebesgue spaces for imaging
- Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- Convergence analysis of an iterative algorithm for fixed point problems and split feasibility problems in certain Banach spaces
- On the convergence of the forward-backward splitting method with linesearches
- Strong convergence theorem for multiple sets split feasibility problems in Banach spaces
- A stopping criterion for iterative regularization methods
- Calibrating local volatility in inverse option pricing using the Levenberg-Marquardt method
- Proximal splitting methods in signal processing
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- Morozov's principle for the augmented Lagrangian method applied to linear inverse problems
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- Projected Barzilai-Borwein method for large-scale nonnegative image restoration
- Ill-posed problems: operator methodologies of resolution and regularization
- A Dual Approach to Linear Inverse Problems with Convex Constraints
- An iterative approximation scheme for solving a split generalized equilibrium, variational inequalities and fixed point problems
- Modulus methods for nonnegatively constrained image restoration
- Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems
- A double forward-backward algorithm using linesearches for minimization problem
- Approximating the minimum-norm fixed point of pseudocontractive mappings
- Projected gradient methods for synchrotron radiation spectra distribution function reconstruction
- The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems
- Relaxed extragradient methods with regularization for general system of variational inequalities with constraints of split feasibility and fixed point problems
- scientific article; zbMATH DE number 3960196 (Why is no real title available?)
- scientific article; zbMATH DE number 50171 (Why is no real title available?)
- Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints
- Strong convergence theorems for the split variational inclusion problem in Hilbert spaces
- Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems
- Regularized methods for the split feasibility problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- scientific article; zbMATH DE number 497610 (Why is no real title available?)
- Regularization of ill-posed constrained minimization problems by iteration methods
- Applications of fixed-point and optimization methods to the multiple-set split feasibility problem
- Forward-backward splitting methods for accretive operators in Banach spaces
- 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
- On a family of gradient-type projection methods for nonlinear ill-posed problems
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Iterative methods for solving ill-posed problems with a priori information in Hilbert spaces
- A new hybrid projection algorithm for solving the split generalized equilibrium problems and the system of variational inequality problems
- Strong convergence result of split feasibility problems in Banach spaces
- Minimum-norm solution of variational inequality and fixed point problem in banach spaces
- Strong convergence of an inertial-type algorithm to a common solution of minimization and fixed point problems
- scientific article; zbMATH DE number 7457420 (Why is no real title available?)
- A Halpern-type iteration for solving the split feasibility problem and the fixed point problem of Bregman relatively nonexpansive semigroup in Banach spaces
- Convergence analysis of hybrid projection with Cesàro mean method for the split equilibrium and general system of finite variational inequalities
- Iterative methods for solving the generalized split common null point problem in Hilbert spaces
- Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations
- Parallel iterative methods for solving the split common fixed point problem in Hilbert spaces
- A viscosity iterative algorithm for split common fixed-point problems of demicontractive mappings
- Modern regularization methods for inverse problems
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Split feasibility and fixed point problems
- A new algorithm for solving the multiple-sets split feasibility problem in Banach spaces
- A fast nonstationary iterative method with convex penalty for inverse problems in Hilbert spaces
- Runge-Kutta type regularization method for inversion of spheroidal particle distribution from limited optical data
- Iterative approximation for convex optimization problems with operator constraints in a Hilbert space
- A characterization of ill-posed data instances for convex programming.
- Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization
- Fejér-type iterative processes in the constrained quadratic minimization problem
- Quasi-Newton projection methods and the discrepancy principle in image restoration
- The geometry of monotone operator splitting methods
- An extragradient method for solving split feasibility and fixed point problems
- A strongly convergent method for the split feasibility problem
- Self-adaptive CQ-type algorithms for the split feasibility problem involving two bounded linear operators in Hilbert spaces
- Regularization methods for the solution of inverse problems in solar X-ray and imaging spectroscopy
- A hybrid viscosity algorithm via modify the hybrid steepest descent method for solving the split variational inclusion in image reconstruction and fixed point problems
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Iteratively solving linear inverse problems under general convex constraints
This page was built for publication: Iteration methods for convexly constrained ill-posed problems in hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4029153)
