Abstract
We consider a minimization model with total variational regularization, which can be reformulated as a saddle-point problem and then be efficiently solved by the primal–dual method. We utilize the consistent finite element method to discretize the saddle-point reformulation; thus possible jumps of the solution can be captured over some adaptive meshes and a generic domain can be easily treated. Our emphasis is analyzing the convergence of a more general primal–dual scheme with a combination factor for the discretized model. We establish the global convergence and derive the worst-case convergence rate measured by the iteration complexity for this general primal–dual scheme. This analysis is new in the finite element context for the minimization model with total variational regularization under discussion. Furthermore, we propose a prediction–correction scheme based on the general primal–dual scheme, which can significantly relax the step size for the discretization in the time direction. Its global convergence and the worst-case convergence rate are also established. Some preliminary numerical results are reported to verify the rationale of considering the general primal–dual scheme and the primal–dual-based prediction–correction scheme.
Original language | English |
---|---|
Pages (from-to) | 243-274 |
Number of pages | 32 |
Journal | Journal of Scientific Computing |
Volume | 76 |
DOIs | |
Publication status | Published - Jul 2018 |
Scopus Subject Areas
- Software
- Theoretical Computer Science
- Numerical Analysis
- General Engineering
- Computational Theory and Mathematics
- Computational Mathematics
- Applied Mathematics
User-Defined Keywords
- Convergence rate
- Finite element method
- Primal–dual method
- Saddle-point problem
- Total variation minimization