Regularization of ill-posed constrained minimization problems by iteration methods
A problem of minimization of a quadratic criterion on a unit ball in a Hilbert space is under consideration. It is assumed that the criterion may have a nontrivial kernel space, so the problem may be ill-posed. The problem itself is a variational reformulation of the problem of finding the normal pseudo-solution to a linear equation in a functional space. Both, the linear operator and the right-hand side in the equation are not known exactly, so the problem naturally involves a small perturbation parameter. Using methods developed in classical works by \textit{F. P. Vasil'ev} [see, e.g., ``Methods for solving extremal problems (1981; Zbl 0553.49001); Proc. Steklov Inst. Math. 185, 65-71 (1990); translation from Tr. Mat. Inst. Steklova 185, 60-65 (1988; Zbl 0735.49020)], the author designs an iterative procedure which combines a descent minimization algorithm with Tikhonov's regularization. A thorough analysis of calculations results in obtaining an estimate of the order of convergence of a sequence of approximate solutions to the normal pseudo-solution. Although the main theorems assert only existence of a regularization parameter such that the obtained estimates hold true, their proofs specify an interval from which an appropriate value of the parameter can be picked up arbitrarily.
- scientific article; zbMATH DE number 665288
- Regularization of ill-posed problems by iteration methods
- On a method of iterative regularization for convex minimization problems
- Iterative regularization for constrained minimization formulations of nonlinear inverse problems
- Iterative regularization methods for nonlinear ill-posed problems
- Iterative regularization techniques for ill-posed problems
- General iterative scheme based on the regularization for solving a constrained convex minimization problem
- A regularized iterative scheme for solving nonlinear ill-posed problems
- A modified iterative regularization method for ill-posed problems
- scientific article; zbMATH DE number 1187415
- An iterative method to compute minimum norm solutions of ill-posed problems in Hilbert spaces
- Some applications of the iterative regularization principle to mathematical programming problems
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- scientific article; zbMATH DE number 665288 (Why is no real title available?)
- scientific article; zbMATH DE number 2059559 (Why is no real title available?)
- Iterative Regularization and MINRES
This page was built for publication: Regularization of ill-posed constrained minimization problems by iteration methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400143)
