Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A Mixed Regularization Method for Ill-Posed Problems

View through CrossRef
In this paper we propose a mixed regularization method for ill-posed problems. This method combines iterative regularization methods and continuous regularization methods effectively. First it applies iterative regularization methods in which there is no continuous regularization parameter to solve the normal equation of the ill-posed problem. Then  continuous regularization methods are applied to solve its residual problem. The presented mixed regularization algorithm is a general framework. Any iterative regularization method and continuous regularization method can be combined together to construct a mixed regularization method. Our theoretical analysis shows that the new mixed regularization method is with optimal order of error estimation and can reach the optimal order under a much wider range of the regularization parameter than the continuous regularization method such as Tikhobov regularization. Moreover, the new mixed regularization method can reduce the sensitivity of the regularization parameter and improve the solution of continuous regularization methods or iterative regularization methods. This advantage is helpful when the optimal regularization parameter is hard to choose. The numerical computations illustrate the effectiveness of our new mixed regularization method.
Title: A Mixed Regularization Method for Ill-Posed Problems
Description:
In this paper we propose a mixed regularization method for ill-posed problems.
This method combines iterative regularization methods and continuous regularization methods effectively.
First it applies iterative regularization methods in which there is no continuous regularization parameter to solve the normal equation of the ill-posed problem.
Then  continuous regularization methods are applied to solve its residual problem.
The presented mixed regularization algorithm is a general framework.
Any iterative regularization method and continuous regularization method can be combined together to construct a mixed regularization method.
Our theoretical analysis shows that the new mixed regularization method is with optimal order of error estimation and can reach the optimal order under a much wider range of the regularization parameter than the continuous regularization method such as Tikhobov regularization.
Moreover, the new mixed regularization method can reduce the sensitivity of the regularization parameter and improve the solution of continuous regularization methods or iterative regularization methods.
This advantage is helpful when the optimal regularization parameter is hard to choose.
The numerical computations illustrate the effectiveness of our new mixed regularization method.

Related Results

Pet Euthanasia and Human Euthanasia
Pet Euthanasia and Human Euthanasia
Photo ID 213552852 © Yuryz | Dreamstime.com Abstract A criticism of assisted death is that it’s contrary to the Hippocratic Oath. This opposition to assisted death assumes that dea...
Analytical Solutions to Minimum-Norm Problems
Analytical Solutions to Minimum-Norm Problems
For G∈Rm×n and g∈Rm, the minimization min∥Gψ−g∥2, with ψ∈Rn, is known as the Tykhonov regularization. We transport the Tykhonov regularization to an infinite-dimensional setting, t...
A multiple-parameter regularization approach for filtering monthly GRACE/GRACE-FO gravity models
A multiple-parameter regularization approach for filtering monthly GRACE/GRACE-FO gravity models
The Gravity Recovery and Climate Experiment (GRACE) and its subsequent GRACE Follow-On (GRACE-FO) missions have been instrumental in monitoring Earth’s mass changes throu...
Regularization of classical optimality conditions in optimization problems for linear Volterra-type systems with functional constraints
Regularization of classical optimality conditions in optimization problems for linear Volterra-type systems with functional constraints
We consider the regularization of classical optimality conditions (COCs) — the Lagrange principle (LP) and the Pontryagin maximum principle (PMP) — in a convex optimal control prob...
Tikhonov Regularization
Tikhonov Regularization
Abstract An important issue in quantitative finance is model calibration . The calibration problem is the inverse ...
New Trends in Applying LRM to Nonlinear Ill-Posed Equations
New Trends in Applying LRM to Nonlinear Ill-Posed Equations
Tautenhahn (2002) studied the Lavrentiev regularization method (LRM) to approximate a stable solution for the ill-posed nonlinear equation κ(u)=v, where κ:D(κ)⊆X⟶X is a nonlinear m...
Joint sparse optimization: lower-order regularization method and application in cell fate conversion
Joint sparse optimization: lower-order regularization method and application in cell fate conversion
Abstract Multiple measurement signals are commonly collected in practical applications, and joint sparse optimization adopts the synchronous effect within multiple m...
Adaptive Image Reconstruction Algorithm for Electrical Capacitance Tomography
Adaptive Image Reconstruction Algorithm for Electrical Capacitance Tomography
Since the image reconstruction of electrical capacitance tomography (ECT) is an inverse problem of ill-posedness, regularization techniques are widely used to obtain stable solutio...

Back to Top