IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v63y2016i1d10.1007_s10589-015-9768-y.html
   My bibliography  Save this article

An acceleration scheme for Dykstra’s algorithm

Author

Listed:
  • Williams López

    () (Universidad de Los Andes)

  • Marcos Raydan

    () (Universidad Simón Bolívar)

Abstract

Abstract Dykstra’s algorithm is an iterative alternating projection procedure for solving the best approximation problem: find the closest point, to a given one, in the intersection of a finite number of closed and convex sets. The main drawback of Dykstra’s algorithm is its frequent slow convergence. In this work we develop an acceleration scheme with a strong geometrical flavor, which guarantees termination at the solution in two cycles of projections in the case of two closed subspaces. The proposed scheme can also be applied to any other alternating projection algorithm that solves the best approximation problem.

Suggested Citation

  • Williams López & Marcos Raydan, 2016. "An acceleration scheme for Dykstra’s algorithm," Computational Optimization and Applications, Springer, vol. 63(1), pages 29-44, January.
  • Handle: RePEc:spr:coopap:v:63:y:2016:i:1:d:10.1007_s10589-015-9768-y
    DOI: 10.1007/s10589-015-9768-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-015-9768-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    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. A. Cegielski & R. Dylewski, 2010. "Variable target value relaxed alternating projection method," Computational Optimization and Applications, Springer, vol. 47(3), pages 455-476, November.
    2. N. Echebest & M. Guardarucci & H. Scolnik & M. Vacchino, 2005. "An Accelerated Iterative Method with Diagonally Scaled Oblique Projections for Solving Linear Feasibility Problems," Annals of Operations Research, Springer, vol. 138(1), pages 235-257, September.
    Full references (including those not matched with items on IDEAS)

    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:63:y:2016:i:1:d:10.1007_s10589-015-9768-y. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.