IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v192y2022icp221-245.html
   My bibliography  Save this article

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

Author

Listed:
  • Gao, Guangyu
  • Han, Bo
  • Tong, Shanshan

Abstract

In this paper, we propose a fast two-point gradient algorithm for solving nonlinear ill-posed problems, which is based on the sequential subspace optimization method. The key idea, in contrast to the standard two-point gradient method, is to use multiple search directions in each iteration without extra computation, and to get the step size by metric projection. Moreover, a modified discrete backtracking search algorithm is proposed to select the combination parameters in the accelerated two-point gradient method. Under the basic assumptions for iterative regularization methods, we establish the convergence results of the method in the noise-free case. Furthermore, stability and regularity are presented when the algorithm terminated by the discrepancy principle for the case of noisy data. Finally, some numerical simulations are presented, which exhibit that the proposed method leads to a significant reduction of the iteration numbers and the overall computational time.

Suggested Citation

  • Gao, Guangyu & Han, Bo & Tong, Shanshan, 2022. "A fast two-point gradient algorithm based on sequential subspace optimization method for nonlinear ill-posed problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 192(C), pages 221-245.
    • Handle: RePEc:eee:matcom:v:192:y:2022:i:c:p:221-245
    DOI: 10.1016/j.matcom.2021.09.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475421003190
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2021.09.004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:192:y:2022:i:c:p:221-245. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.