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

An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function

Author

Listed:
  • Ying Gao

    (University of Electronic Science and Technology of China)

  • Wenxing Zhang

    (University of Electronic Science and Technology of China)

Abstract

Primal-dual hybrid gradient (PDHG) method is a canonical and popular prototype for solving saddle point problem (SPP). However, the nonlinear coupling term in SPP excludes the application of PDHG on far-reaching real-world problems. In this paper, following the seminal work by Valkonen (Inverse Problems 30, 2014), we devise a variant iterative scheme for solving SPP with nonlinear function by exerting an alternative extrapolation procedure. The novel iterative scheme falls exactly into the proximal point algorithmic framework without any residuals, which indicates that the associated inclusion problem is “nearer” to the KKT mapping induced by SPP. Under the metrically regular assumption on KKT mapping, we simplify the local convergence of the proposed method on contractive perspective. Numerical simulations on a PDE-constrained nonlinear inverse problem demonstrate the compelling performance of the proposed method.

Suggested Citation

  • Ying Gao & Wenxing Zhang, 2023. "An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function," Computational Optimization and Applications, Springer, vol. 85(1), pages 263-291, May.
    • Handle: RePEc:spr:coopap:v:85:y:2023:i:1:d:10.1007_s10589-023-00453-8
    DOI: 10.1007/s10589-023-00453-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-023-00453-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-023-00453-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. Bingsheng He & Xiaoming Yuan & Wenxing Zhang, 2013. "A customized proximal point algorithm for convex minimization with linear constraints," Computational Optimization and Applications, Springer, vol. 56(3), pages 559-572, 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. Xingju Cai & Deren Han & Lingling Xu, 2013. "An improved first-order primal-dual algorithm with a new correction step," Journal of Global Optimization, Springer, vol. 57(4), pages 1419-1428, December.
    4. Guoyong Gu & Bingsheng He & Xiaoming Yuan, 2014. "Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach," Computational Optimization and Applications, Springer, vol. 59(1), pages 135-161, October.
    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. Rochet, Jean-Charles & Carlier, Guillaume & Dupuis, Xavier & Thanassoulis, John, 2024. "A General Solution to the Quasi Linear Screening Problem," TSE Working Papers 24-1537, Toulouse School of Economics (TSE).
    2. repec:hal:journl:hal-04598698 is not listed 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. Hongjin He & Jitamitra Desai & Kai Wang, 2016. "A primal–dual prediction–correction algorithm for saddle point optimization," Journal of Global Optimization, Springer, vol. 66(3), pages 573-583, November.
    2. Yunda Dong, 2021. "Weak convergence of an extended splitting method for monotone inclusions," Journal of Global Optimization, Springer, vol. 79(1), pages 257-277, January.
    3. 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.
    4. Xin Jiang & Lieven Vandenberghe, 2022. "Bregman primal–dual first-order method and application to sparse semidefinite programming," Computational Optimization and Applications, Springer, vol. 81(1), pages 127-159, January.
    5. Feng Ma, 2019. "On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective," Computational Optimization and Applications, Springer, vol. 73(3), pages 871-901, July.
    6. Yanqin Bai & Xiao Han & Tong Chen & Hua Yu, 2015. "Quadratic kernel-free least squares support vector machine for target diseases classification," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 850-870, November.
    7. Radu Ioan Bot & Dang-Khoa Nguyen, 2020. "The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 682-712, May.
    8. Julian Rasch & Antonin Chambolle, 2020. "Inexact first-order primal–dual algorithms," Computational Optimization and Applications, Springer, vol. 76(2), pages 381-430, June.
    9. 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.
    10. Fu, Penghui & Tan, Zhiqiang, 2024. "Block-wise primal-dual algorithms for large-scale doubly penalized ANOVA modeling," Computational Statistics & Data Analysis, Elsevier, vol. 194(C).
    11. 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.
    12. Yawei Shi & Liang Ran & Jialong Tang & Xiangzhao Wu, 2022. "Distributed Optimization Algorithm for Composite Optimization Problems with Non-Smooth Function," Mathematics, MDPI, vol. 10(17), pages 1-17, September.
    13. Xiaoliang Wang & Liping Pang & Qi Wu & Mingkun Zhang, 2021. "An Adaptive Proximal Bundle Method with Inexact Oracles for a Class of Nonconvex and Nonsmooth Composite Optimization," Mathematics, MDPI, vol. 9(8), pages 1-27, April.
    14. Liusheng Hou & Hongjin He & Junfeng Yang, 2016. "A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA," Computational Optimization and Applications, Springer, vol. 63(1), pages 273-303, January.
    15. Luis Briceño-Arias & Sergio López Rivera, 2019. "A Projected Primal–Dual Method for Solving Constrained Monotone Inclusions," Journal of Optimization Theory and Applications, Springer, vol. 180(3), pages 907-924, March.
    16. Walaa M. Moursi & Lieven Vandenberghe, 2019. "Douglas–Rachford Splitting for the Sum of a Lipschitz Continuous and a Strongly Monotone Operator," Journal of Optimization Theory and Applications, Springer, vol. 183(1), pages 179-198, October.
    17. 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.
    18. Ernest K. Ryu & Bằng Công Vũ, 2020. "Finding the Forward-Douglas–Rachford-Forward Method," Journal of Optimization Theory and Applications, Springer, vol. 184(3), pages 858-876, March.
    19. Adil Salim & Laurent Condat & Konstantin Mishchenko & Peter Richtárik, 2022. "Dualize, Split, Randomize: Toward Fast Nonsmooth Optimization Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 195(1), pages 102-130, October.
    20. Eike Börgens & Christian Kanzow, 2019. "Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces," Computational Optimization and Applications, Springer, vol. 73(3), pages 755-790, July.

    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:85:y:2023:i:1:d:10.1007_s10589-023-00453-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.