A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems

DOI10.1016/J.MATCOM.2021.09.004arXiv1911.01728MaRDI QIDQ6328547FDOQ6328547

Publication date: 5 November 2019

Abstract: In this paper, we propose and analyze a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. A complete convergence analysis is provided under the classical assumptions for iterative regularization methods. The design of the two-point gradient method involves the choices of the combination parameters which is systematically discussed. Furthermore, detailed numerical simulations are presented for inverse potential problem, which exhibit that the proposed method leads to a strongly decrease of the iteration numbers and the overall computational time can be significantly reduced.

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

This page was built for publication: A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6328547)