lavrentiev regularization
Recently Published Documents


TOTAL DOCUMENTS

41
(FIVE YEARS 2)

H-INDEX

9
(FIVE YEARS 0)

2019 ◽  
Vol 25 ◽  
pp. 5
Author(s):  
Zixuan Chen ◽  
Xiaoliang Song ◽  
Xuping Zhang ◽  
Bo Yu

In this paper, Elliptic control problems with pointwise box constraints on the state is considered, where the corresponding Lagrange multipliers in general only represent regular Borel measure functions. To tackle this difficulty, the Lavrentiev regularization is employed to deal with the state constraints. To numerically discretize the resulted problem, full piecewise linear finite element discretization is employed. Estimation of the error produced by regularization and discretization is done. The error order of full discretization is not inferior to that of variational discretization because of the Lavrentiev-regularization. Taking the discretization error into account, algorithms of high precision do not make much sense. Utilizing efficient first-order algorithms to solve discretized problems to moderate accuracy is sufficient. Then a heterogeneous alternating direction method of multipliers (hADMM) is proposed. Different from the classical ADMM, our hADMM adopts two different weighted norms in two subproblems respectively. Additionally, to get more accurate solution, a two-phase strategy is presented, in which the primal-dual active set (PDAS) method is used as a postprocessor of the hADMM. Numerical results not only verify error estimates but also show the efficiency of the hADMM and the two-phase strategy.


2018 ◽  
Vol 26 (2) ◽  
pp. 153-170 ◽  
Author(s):  
Chunmei Zeng ◽  
Xingjun Luo ◽  
Suhua Yang ◽  
Fanchun Li

AbstractIn this paper we apply the multilevel augmentation method to solve an ill-posed integral equation via the iterated Lavrentiev regularization. This method leads to fast solutions of discrete iterated Lavrentiev regularization. The convergence rates of the iterated Lavrentiev regularization are achieved by using a certain parameter choice strategy. Finally, numerical experiments are given to illustrate the efficiency of the method.


2017 ◽  
Vol 87 (310) ◽  
pp. 785-801 ◽  
Author(s):  
Robert Plato ◽  
Peter Mathé ◽  
Bernd Hofmann

2017 ◽  
Vol 17 (2) ◽  
pp. 269-285 ◽  
Author(s):  
Pallavi Mahale

AbstractMahale and Nair [12] considered an iterated form of Lavrentiev regularization for obtaining stable approximate solutions for ill-posed nonlinear equations of the form ${F(x)=y}$, where ${F:D(F)\subseteq X\to X}$ is a nonlinear monotone operator and X is a Hilbert space. They considered an a posteriori strategy to find a stopping index which not only led to the convergence of the method, but also gave an order optimal error estimate under a general source condition. However, the iterations defined in [12] require calculation of Fréchet derivatives at each iteration. In this paper, we consider a simplified version of the iterated Lavrentiev regularization which will involve calculation of the Fréchet derivative only at the point ${x_{0}}$, i.e., at the initial approximation of the exact solution ${x^{\dagger}}$. Moreover, the general source condition and stopping rule which we use in this paper involve calculation of the Fréchet derivative at the point ${x_{0}}$, instead at the unknown exact solution ${x^{\dagger}}$ as in [12].


Sign in / Sign up

Export Citation Format

Share Document