IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v79y2021i2d10.1007_s10589-021-00275-6.html
   My bibliography  Save this article

The circumcentered-reflection method achieves better rates than alternating projections

Author

Listed:
  • Reza Arefidamghani

    (Instituto de Matemática Pura e Aplicada)

  • Roger Behling

    (Fundação Getúlio Vargas)

  • Yunier Bello-Cruz

    (Northern Illinois University)

  • Alfredo N. Iusem

    (Instituto de Matemática Pura e Aplicada)

  • Luiz-Rafael Santos

    (Federal University of Santa Catarina)

Abstract

We study the convergence rate of the Circumcentered-Reflection Method (CRM) for solving the convex feasibility problem and compare it with the Method of Alternating Projections (MAP). Under an error bound assumption, we prove that both methods converge linearly, with asymptotic constants depending on a parameter of the error bound, and that the one derived for CRM is strictly better than the one for MAP. Next, we analyze two classes of fairly generic examples. In the first one, the angle between the convex sets approaches zero near the intersection, so that the MAP sequence converges sublinearly, but CRM still enjoys linear convergence. In the second class of examples, the angle between the sets does not vanish and MAP exhibits its standard behavior, i.e., it converges linearly, yet, perhaps surprisingly, CRM attains superlinear convergence.

Suggested Citation

  • Reza Arefidamghani & Roger Behling & Yunier Bello-Cruz & Alfredo N. Iusem & Luiz-Rafael Santos, 2021. "The circumcentered-reflection method achieves better rates than alternating projections," Computational Optimization and Applications, Springer, vol. 79(2), pages 507-530, June.
    • Handle: RePEc:spr:coopap:v:79:y:2021:i:2:d:10.1007_s10589-021-00275-6
    DOI: 10.1007/s10589-021-00275-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-021-00275-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10589-021-00275-6?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.

    References listed on IDEAS

    as
    1. Roger Behling & Douglas S. Gonçalves & Sandra A. Santos, 2019. "Local Convergence Analysis of the Levenberg–Marquardt Framework for Nonzero-Residue Nonlinear Least-Squares Problems Under an Error Bound Condition," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 1099-1122, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hui Ouyang & Xianfu Wang, 2021. "Bregman Circumcenters: Basic Theory," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 252-280, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nataša Krejić & Greta Malaspina & Lense Swaenen, 2023. "A split Levenberg-Marquardt method for large-scale sparse problems," Computational Optimization and Applications, Springer, vol. 85(1), pages 147-179, May.
    2. Naoki Marumo & Takayuki Okuno & Akiko Takeda, 2023. "Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares," Computational Optimization and Applications, Springer, vol. 84(3), pages 833-874, April.
    3. Boos, Everton & Gonçalves, Douglas S. & Bazán, Fermín S.V., 2024. "Levenberg-Marquardt method with singular scaling and applications," Applied Mathematics and Computation, Elsevier, vol. 474(C).

    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:spr:coopap:v:79:y:2021:i:2:d:10.1007_s10589-021-00275-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.