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

On FISTA with a relative error rule

Author

Listed:
  • Yunier Bello-Cruz

    (Northern Illinois University)

  • Max L. N. Gonçalves

    (Universidade Federal de Goiás)

  • Nathan Krislock

    (Northern Illinois University)

Abstract

The fast iterative shrinkage/thresholding algorithm (FISTA) is one of the most popular first-order iterations for minimizing the sum of two convex functions. FISTA is known to improve the complexity of the classical proximal gradient method (PGM) from $$O(k^{-1})$$ O ( k - 1 ) to the optimal complexity $$O(k^{-2})$$ O ( k - 2 ) in terms of the sequence of the functional values. When the evaluation of the proximal operator is hard, inexact versions of FISTA might be used to solve the problem. In this paper, we proposed an inexact version of FISTA by solving the proximal subproblem inexactly using a relative error criterion instead of exogenous and diminishing error rules. The introduced relative error rule in the FISTA iteration is related to the progress of the algorithm at each step and does not increase the computational burden per iteration. Moreover, the proposed algorithm recovers the same optimal convergence rate as FISTA. Some numerical experiments are also reported to illustrate the numerical behavior of the relative inexact method when compared with FISTA under an absolute error criterion.

Suggested Citation

  • Yunier Bello-Cruz & Max L. N. Gonçalves & Nathan Krislock, 2023. "On FISTA with a relative error rule," Computational Optimization and Applications, Springer, vol. 84(2), pages 295-318, March.
    • Handle: RePEc:spr:coopap:v:84:y:2023:i:2:d:10.1007_s10589-022-00421-8
    DOI: 10.1007/s10589-022-00421-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-022-00421-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-00421-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. R. Díaz Millán & M. Pentón Machado, 2019. "Inexact proximal $$\epsilon $$ϵ-subgradient methods for composite convex optimization problems," Journal of Global Optimization, Springer, vol. 75(4), pages 1029-1060, December.
    2. NESTEROV, Yurii, 2013. "Gradient methods for minimizing composite functions," LIDAM Reprints CORE 2510, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. M. Marques Alves & Jonathan Eckstein & Marina Geremia & Jefferson G. Melo, 2020. "Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms," Computational Optimization and Applications, Springer, vol. 75(2), pages 389-422, March.
    5. Lewandowski, Daniel & Kurowicka, Dorota & Joe, Harry, 2009. "Generating random correlation matrices based on vines and extended onion method," Journal of Multivariate Analysis, Elsevier, vol. 100(9), pages 1989-2001, October.
    6. Jonathan Eckstein & Wang Yao, 2017. "Approximate ADMM algorithms derived from Lagrangian splitting," Computational Optimization and Applications, Springer, vol. 68(2), pages 363-405, November.
    7. Vando A. Adona & Max L. N. Gonçalves & Jefferson G. Melo, 2019. "A Partially Inexact Proximal Alternating Direction Method of Multipliers and Its Iteration-Complexity Analysis," Journal of Optimization Theory and Applications, Springer, vol. 182(2), pages 640-666, August.
    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. V. A. Adona & M. L. N. Gonçalves & J. G. Melo, 2020. "An inexact proximal generalized alternating direction method of multipliers," Computational Optimization and Applications, Springer, vol. 76(3), pages 621-647, July.
    2. Ren Jiang & Zhifeng Ji & Wuling Mo & Suhua Wang & Mingjun Zhang & Wei Yin & Zhen Wang & Yaping Lin & Xueke Wang & Umar Ashraf, 2022. "A Novel Method of Deep Learning for Shear Velocity Prediction in a Tight Sandstone Reservoir," Energies, MDPI, vol. 15(19), pages 1-20, September.
    3. Flórez, Alvaro J. & Molenberghs, Geert & Van der Elst, Wim & Alonso Abad, Ariel, 2022. "An efficient algorithm to assess multivariate surrogate endpoints in a causal inference framework," Computational Statistics & Data Analysis, Elsevier, vol. 172(C).
    4. Giuseppe Brandi & Ruggero Gramatica & Tiziana Di Matteo, 2019. "Unveil stock correlation via a new tensor-based decomposition method," Papers 1911.06126, arXiv.org, revised Apr 2020.
    5. Masaru Ito, 2016. "New results on subgradient methods for strongly convex optimization problems with a unified analysis," Computational Optimization and Applications, Springer, vol. 65(1), pages 127-172, September.
    6. 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).
    7. Dimitris Bertsimas & Ryan Cory-Wright, 2022. "A Scalable Algorithm for Sparse Portfolio Selection," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1489-1511, May.
    8. Weibin Mo & Yufeng Liu, 2022. "Efficient learning of optimal individualized treatment rules for heteroscedastic or misspecified treatment‐free effect models," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(2), pages 440-472, April.
    9. Liu, Yulan & Bi, Shujun, 2019. "Error bounds for non-polyhedral convex optimization and applications to linear convergence of FDM and PGM," Applied Mathematics and Computation, Elsevier, vol. 358(C), pages 418-435.
    10. 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.
    11. Hirofumi Michimae & Takeshi Emura, 2022. "Bayesian ridge estimators based on copula-based joint prior distributions for regression coefficients," Computational Statistics, Springer, vol. 37(5), pages 2741-2769, November.
    12. Madar, Vered, 2015. "Direct formulation to Cholesky decomposition of a general nonsingular correlation matrix," Statistics & Probability Letters, Elsevier, vol. 103(C), pages 142-147.
    13. Saif Eddin Jabari & Nikolaos M. Freris & Deepthi Mary Dilip, 2020. "Sparse Travel Time Estimation from Streaming Data," Transportation Science, INFORMS, vol. 54(1), pages 1-20, January.
    14. Ching-pei Lee & Stephen J. Wright, 2019. "Inexact Successive quadratic approximation for regularized optimization," Computational Optimization and Applications, Springer, vol. 72(3), pages 641-674, April.
    15. Vuorre, Matti & Bolger, Niall, 2017. "Within-subject mediation analysis," OSF Preprints s48e2_v1, Center for Open Science.
    16. Kang, Seungwoo & Oh, Hee-Seok, 2024. "Forecasting South Korea’s presidential election via multiparty dynamic Bayesian modeling," International Journal of Forecasting, Elsevier, vol. 40(1), pages 124-141.
    17. Le Thi Khanh Hien & Cuong V. Nguyen & Huan Xu & Canyi Lu & Jiashi Feng, 2019. "Accelerated Randomized Mirror Descent Algorithms for Composite Non-strongly Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 181(2), pages 541-566, May.
    18. 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.
    19. Pretnar, Nick, 2022. "Measuring Inequality with Consumption Time," MPRA Paper 118168, University Library of Munich, Germany.
    20. Reza Eghbali & Maryam Fazel, 2017. "Decomposable norm minimization with proximal-gradient homotopy algorithm," Computational Optimization and Applications, Springer, vol. 66(2), pages 345-381, March.

    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:84:y:2023:i:2:d:10.1007_s10589-022-00421-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.