IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v83y2022i3d10.1007_s10589-022-00413-8.html
   My bibliography  Save this article

Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions

Author

Listed:
  • Scott B. Lindstrom

    (Curtin University)

Abstract

For many problems, some of which are reviewed in the paper, popular algorithms like Douglas–Rachford (DR), ADMM, and FISTA produce approximating sequences that show signs of spiraling toward the solution. We present a meta-algorithm that exploits such dynamics to potentially enhance performance. The strategy of this meta-algorithm is to iteratively build and minimize surrogates for the Lyapunov function that captures those dynamics. As a first motivating application, we show that for prototypical feasibility problems the circumcentered-reflection method, subgradient projections, and Newton–Raphson are all describable as gradient-based methods for minimizing Lyapunov functions constructed for DR operators, with the former returning the minimizers of spherical surrogates for the Lyapunov function. As a second motivating application, we introduce a new method that shares these properties but with the added advantages that it: (1) does not rely on subproblems (e.g. reflections) and so may be applied for any operator whose iterates have the spiraling property; (2) provably has the aforementioned Lyapunov properties with few structural assumptions and so is generically suitable for primal/dual implementation; and (3) maps spaces of reduced dimension into themselves whenever the original operator does. This makes possible the first primal/dual implementation of a method that seeks the center of spiraling iterates. We describe this method, and provide a computed example (basis pursuit).

Suggested Citation

  • Scott B. Lindstrom, 2022. "Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions," Computational Optimization and Applications, Springer, vol. 83(3), pages 999-1026, December.
  • Handle: RePEc:spr:coopap:v:83:y:2022:i:3:d:10.1007_s10589-022-00413-8
    DOI: 10.1007/s10589-022-00413-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-022-00413-8
    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-022-00413-8?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. Joël Benoist, 2015. "The Douglas–Rachford algorithm for the case of the sphere and the line," Journal of Global Optimization, Springer, vol. 63(2), pages 363-380, October.
    Full references (including those not matched with items on IDEAS)

    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. Hoa T. Bui & Scott B. Lindstrom & Vera Roshchina, 2019. "Variational Analysis Down Under Open Problem Session," Journal of Optimization Theory and Applications, Springer, vol. 182(1), pages 430-437, July.
    2. Francisco J. Aragón Artacho & Rubén Campoy, 2018. "A new projection method for finding the closest point in the intersection of convex sets," Computational Optimization and Applications, Springer, vol. 69(1), pages 99-132, January.
    3. Francisco J. Aragón Artacho & Rubén Campoy & Matthew K. Tam, 2020. "The Douglas–Rachford algorithm for convex and nonconvex feasibility problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(2), pages 201-240, April.
    4. Heinz H. Bauschke & Minh N. Dao & Scott B. Lindstrom, 2019. "The Douglas–Rachford algorithm for a hyperplane and a doubleton," Journal of Global Optimization, Springer, vol. 74(1), pages 79-93, May.
    5. Minh N. Dao & Matthew K. Tam, 2019. "A Lyapunov-type approach to convergence of the Douglas–Rachford algorithm for a nonconvex setting," Journal of Global Optimization, Springer, vol. 73(1), pages 83-112, January.
    6. Ohad Giladi & Björn S. Rüffer, 2019. "A Lyapunov Function Construction for a Non-convex Douglas–Rachford Iteration," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 729-750, March.
    7. Francisco J. Aragón Artacho & Rubén Campoy & Veit Elser, 2020. "An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm," Journal of Global Optimization, Springer, vol. 77(2), pages 383-403, June.
    8. Francisco J. Aragón Artacho & Jonathan M. Borwein & Matthew K. Tam, 2016. "Global behavior of the Douglas–Rachford method for a nonconvex feasibility problem," Journal of Global Optimization, Springer, vol. 65(2), pages 309-327, June.

    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:83:y:2022:i:3:d:10.1007_s10589-022-00413-8. 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.