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

Inexact first-order primal–dual algorithms

Author

Listed:
  • Julian Rasch

    (Westfälische Wilhelms-Universität (WWU) Münster)

  • Antonin Chambolle

    (CMAP)

Abstract

We investigate the convergence of a recently popular class of first-order primal–dual algorithms for saddle point problems under the presence of errors in the proximal maps and gradients. We study several types of errors and show that, provided a sufficient decay of these errors, the same convergence rates as for the error-free algorithm can be established. More precisely, we prove the (optimal) $$O\left( 1/N\right)$$O1/N convergence to a saddle point in finite dimensions for the class of non-smooth problems considered in this paper, and prove a $$O\left( 1/N^2\right)$$O1/N2 or even linear $$O\left( \theta ^N\right)$$OθN convergence rate if either the primal or dual objective respectively both are strongly convex. Moreover we show that also under a slower decay of errors we can establish rates, however slower and directly depending on the decay of the errors. We demonstrate the performance and practical use of the algorithms on the example of nested algorithms and show how they can be used to split the global objective more efficiently.

Suggested Citation

  • Julian Rasch & Antonin Chambolle, 2020. "Inexact first-order primal–dual algorithms," Computational Optimization and Applications, Springer, vol. 76(2), pages 381-430, June.
    • Handle: RePEc:spr:coopap:v:76:y:2020:i:2:d:10.1007_s10589-020-00186-y
    DOI: 10.1007/s10589-020-00186-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-020-00186-y
    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-020-00186-y?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. R. Cominetti, 1997. "Coupling the Proximal Point Algorithm with Approximation Methods," Journal of Optimization Theory and Applications, Springer, vol. 95(3), pages 581-600, December.
    2. Laurent Condat, 2013. "A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms," Journal of Optimization Theory and Applications, Springer, vol. 158(2), pages 460-479, August.
    3. Bingsheng He & Xiaoming Yuan, 2012. "An Accelerated Inexact Proximal Point Algorithm for Convex Minimization," Journal of Optimization Theory and Applications, Springer, vol. 154(2), pages 536-548, August.
    4. R. T. Rockafellar, 1976. "Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 97-116, May.
    5. Patrick L. Combettes & Jean-Christophe Pesquet, 2011. "Proximal Splitting Methods in Signal Processing," Springer Optimization and Its Applications, in: Heinz H. Bauschke & Regina S. Burachik & Patrick L. Combettes & Veit Elser & D. Russell Luke & Henry (ed.), Fixed-Point Algorithms for Inverse Problems in Science and Engineering, chapter 0, pages 185-212, Springer.
    6. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2011. "First-order methods of smooth convex optimization with inexact oracle," LIDAM Discussion Papers CORE 2011002, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Puya Latafat & Panagiotis Patrinos, 2017. "Asymmetric forward–backward–adjoint splitting for solving monotone inclusions involving three operators," Computational Optimization and Applications, Springer, vol. 68(1), pages 57-93, September.
    2. Gui-Hua Lin & Zhen-Ping Yang & Hai-An Yin & Jin Zhang, 2023. "A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems," Computational Optimization and Applications, Springer, vol. 86(2), pages 669-710, November.
    3. Hedy Attouch & Alexandre Cabot & Zaki Chbani & Hassan Riahi, 2018. "Inertial Forward–Backward Algorithms with Perturbations: Application to Tikhonov Regularization," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 1-36, October.
    4. Jueyou Li & Zhiyou Wu & Changzhi Wu & Qiang Long & Xiangyu Wang, 2016. "An Inexact Dual Fast Gradient-Projection Method for Separable Convex Optimization with Linear Coupled Constraints," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 153-171, January.
    5. TAYLOR, Adrien B. & HENDRICKX, Julien M. & François GLINEUR, 2016. "Exact worst-case performance of first-order methods for composite convex optimization," LIDAM Discussion Papers CORE 2016052, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Sun, Shilin & Wang, Tianyang & Yang, Hongxing & Chu, Fulei, 2022. "Damage identification of wind turbine blades using an adaptive method for compressive beamforming based on the generalized minimax-concave penalty function," Renewable Energy, Elsevier, vol. 181(C), pages 59-70.
    7. David Degras, 2021. "Sparse group fused lasso for model segmentation: a hybrid approach," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 15(3), pages 625-671, September.
    8. Ya-Feng Liu & Xin Liu & Shiqian Ma, 2019. "On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 632-650, May.
    9. Patrick R. Johnstone & Pierre Moulin, 2017. "Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions," Computational Optimization and Applications, Springer, vol. 67(2), pages 259-292, June.
    10. Adrien B. Taylor & Julien M. Hendrickx & François Glineur, 2018. "Exact Worst-Case Convergence Rates of the Proximal Gradient Method for Composite Convex Minimization," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 455-476, August.
    11. Felipe Alvarez & Miguel Carrasco & Karine Pichard, 2005. "Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 966-984, November.
    12. Chengjing Wang & Peipei Tang, 2017. "A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming," Computational Optimization and Applications, Springer, vol. 68(3), pages 503-532, December.
    13. Fu-Quan Xia & Nan-Jing Huang, 2011. "A Projection-Proximal Point Algorithm for Solving Generalized Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 150(1), pages 98-117, July.
    14. Masoud Ahookhosh & Arnold Neumaier, 2018. "Solving structured nonsmooth convex optimization with complexity $$\mathcal {O}(\varepsilon ^{-1/2})$$ O ( ε - 1 / 2 )," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 110-145, April.
    15. S. Bonettini & M. Prato & S. Rebegoldi, 2023. "A nested primal–dual FISTA-like scheme for composite convex optimization problems," Computational Optimization and Applications, Springer, vol. 84(1), pages 85-123, January.
    16. Myeongmin Kang & Myungjoo Kang & Miyoun Jung, 2015. "Inexact accelerated augmented Lagrangian methods," Computational Optimization and Applications, Springer, vol. 62(2), pages 373-404, November.
    17. Luis Briceño-Arias & Julio Deride & Cristian Vega, 2022. "Random Activations in Primal-Dual Splittings for Monotone Inclusions with a Priori Information," Journal of Optimization Theory and Applications, Springer, vol. 192(1), pages 56-81, January.
    18. Xin Jiang & Lieven Vandenberghe, 2023. "Bregman Three-Operator Splitting Methods," Journal of Optimization Theory and Applications, Springer, vol. 196(3), pages 936-972, March.
    19. Alberto De Marchi & Andreas Themelis, 2022. "Proximal Gradient Algorithms Under Local Lipschitz Gradient Continuity," Journal of Optimization Theory and Applications, Springer, vol. 194(3), pages 771-794, September.
    20. Patrick R. Johnstone & Jonathan Eckstein, 2021. "Single-forward-step projective splitting: exploiting cocoercivity," Computational Optimization and Applications, Springer, vol. 78(1), pages 125-166, January.

    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:76:y:2020:i:2:d:10.1007_s10589-020-00186-y. 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.