IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this article

An acceleration scheme for Dykstra’s algorithm

Listed author(s):
  • Williams López

    ()

    (Universidad de Los Andes)

  • Marcos Raydan

    ()

    (Universidad Simón Bolívar)

Registered author(s):

    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.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    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 look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Springer in its journal Computational Optimization and Applications.

    Volume (Year): 63 (2016)
    Issue (Month): 1 (January)
    Pages: 29-44

    as
    in new window

    Handle: RePEc:spr:coopap:v:63:y:2016:i:1:d:10.1007_s10589-015-9768-y
    DOI: 10.1007/s10589-015-9768-y
    Contact details of provider: Web page: http://www.springer.com

    Order Information: Web: http://www.springer.com/math/journal/10589

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as
    in new window


    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)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    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)

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.