IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v43y2018i4p1143-1176.html
   My bibliography  Save this article

Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings

Author

Listed:
  • D. Russell Luke

    (Institut für Numerische und Angewandte Mathematik, Universität Göttingen, 37083 Göttingen, Germany)

  • Nguyen H. Thao

    (Delft Center for Systems and Control, Delft University of Technology, 2628 CD Delft, Netherlands)

  • Matthew K. Tam

    (Institut für Numerische und Angewandte Mathematik, Universität Göttingen, 37083 Göttingen, Germany)

Abstract

We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-valued fixed point mappings. There are two key components of the analysis. The first is a natural generalization of single-valued averaged mappings to expansive set-valued mappings that characterizes a type of strong calmness of the fixed point mapping. The second component to this analysis is an extension of the well-established notion of metric subregularity—or inverse calmness—of the mapping at fixed points. Convergence of expansive fixed point iterations is proved using these two properties, and quantitative estimates are a natural by-product of the framework. To demonstrate the application of the theory, we prove, for the first time, a number of results showing local linear convergence of nonconvex cyclic projections for inconsistent (and consistent) feasibility problems, local linear convergence of the forward-backward algorithm for structured optimization without convexity, strong or otherwise, and local linear convergence of the Douglas-Rachford algorithm for structured nonconvex minimization. This theory includes earlier approaches for known results, convex and nonconvex, as special cases.

Suggested Citation

  • D. Russell Luke & Nguyen H. Thao & Matthew K. Tam, 2018. "Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings," Mathematics of Operations Research, INFORMS, vol. 43(4), pages 1143-1176, November.
    • Handle: RePEc:inm:ormoor:v:43:y:2018:i:4:p:1143-1176
    DOI: 10.1287/moor.2017.0898
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2017.0898
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2017.0898?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
    ---><---

    References listed on IDEAS

    as
    1. Alexander Y. Kruger & Nguyen H. Thao, 2015. "Quantitative Characterizations of Regularity Properties of Collections of Sets," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 41-67, January.
    2. NESTEROV, Yu., 2007. "Gradient methods for minimizing composite objective function," LIDAM Discussion Papers CORE 2007076, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Adrian S. Lewis & Jérôme Malick, 2008. "Alternating Projections on Manifolds," Mathematics of Operations Research, INFORMS, vol. 33(1), pages 216-234, February.
    4. Teemu Pennanen, 2002. "Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity," Mathematics of Operations Research, INFORMS, vol. 27(1), pages 170-191, February.
    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. Minh N. Dao & Neil D. Dizon & Jeffrey A. Hogan & Matthew K. Tam, 2021. "Constraint Reduction Reformulations for Projection Algorithms with Applications to Wavelet Construction," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 201-233, July.
    2. Minh N. Dao, & Hung M. Phan, 2019. "Linear Convergence of Projection Algorithms," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 715-738, May.

    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. Nguyen Hieu Thao, 2018. "A convergent relaxation of the Douglas–Rachford algorithm," Computational Optimization and Applications, Springer, vol. 70(3), pages 841-863, 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. Umberto Amato & Anestis Antoniadis & Italia De Feis & Irene Gijbels, 2021. "Penalised robust estimators for sparse and high-dimensional linear models," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 30(1), pages 1-48, March.
    4. Mingqiang Li & Congying Han & Ruxin Wang & Tiande Guo, 2017. "Shrinking gradient descent algorithms for total variation regularized image denoising," Computational Optimization and Applications, Springer, vol. 68(3), pages 643-660, December.
    5. Hansen, Christian & Liao, Yuan, 2019. "The Factor-Lasso And K-Step Bootstrap Approach For Inference In High-Dimensional Economic Applications," Econometric Theory, Cambridge University Press, vol. 35(3), pages 465-509, June.
    6. Paul Tseng, 2004. "An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods," Mathematics of Operations Research, INFORMS, vol. 29(1), pages 27-44, February.
    7. Umberto Amato & Anestis Antoniadis & Italia Feis & Irène Gijbels, 2022. "Penalized wavelet estimation and robust denoising for irregular spaced data," Computational Statistics, Springer, vol. 37(4), pages 1621-1651, September.
    8. Silvia Villa & Lorenzo Rosasco & Sofia Mosci & Alessandro Verri, 2014. "Proximal methods for the latent group lasso penalty," Computational Optimization and Applications, Springer, vol. 58(2), pages 381-407, June.
    9. Kenneth Lange & Eric C. Chi & Hua Zhou, 2014. "A Brief Survey of Modern Optimization for Statisticians," International Statistical Review, International Statistical Institute, vol. 82(1), pages 46-70, April.
    10. Qihang Lin & Lin Xiao, 2015. "An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization," Computational Optimization and Applications, Springer, vol. 60(3), pages 633-674, April.
    11. David Salas & Lionel Thibault, 2019. "On Characterizations of Submanifolds via Smoothness of the Distance Function in Hilbert Spaces," Journal of Optimization Theory and Applications, Springer, vol. 182(1), pages 189-210, July.
    12. Jonathan Eckstein & Paulo Silva, 2010. "Proximal methods for nonlinear programming: double regularization and inexact subproblems," Computational Optimization and Applications, Springer, vol. 46(2), pages 279-304, June.
    13. Zachary F. Fisher & Younghoon Kim & Barbara L. Fredrickson & Vladas Pipiras, 2022. "Penalized Estimation and Forecasting of Multiple Subject Intensive Longitudinal Data," Psychometrika, Springer;The Psychometric Society, vol. 87(2), pages 1-29, June.
    14. Yao Dong & He Jiang, 2018. "A Two-Stage Regularization Method for Variable Selection and Forecasting in High-Order Interaction Model," Complexity, Hindawi, vol. 2018, pages 1-12, November.
    15. Radu-Alexandru Dragomir & Alexandre d’Aspremont & Jérôme Bolte, 2021. "Quartic First-Order Methods for Low-Rank Minimization," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 341-363, May.
    16. Qihang Lin & Xi Chen & Javier Peña, 2014. "A sparsity preserving stochastic gradient methods for sparse regression," Computational Optimization and Applications, Springer, vol. 58(2), pages 455-482, June.
    17. Jean-Baptiste Hiriart-Urruty & Jérôme Malick, 2012. "A Fresh Variational-Analysis Look at the Positive Semidefinite Matrices World," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 551-577, June.
    18. Y. D. Dong & A. Fischer, 2006. "A Framework for Analyzing Local Convergence Properties with Applications to Proximal-Point Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 131(1), pages 53-68, October.
    19. Xiubo Liang & Guoqiang Wang & Bo Yu, 2022. "A reduced proximal-point homotopy method for large-scale non-convex BQP," Computational Optimization and Applications, Springer, vol. 81(2), pages 539-567, March.
    20. Rocha, Rogério Azevedo & Oliveira, Paulo Roberto & Gregório, Ronaldo Malheiros & Souza, Michael, 2016. "Logarithmic quasi-distance proximal point scalarization method for multi-objective programming," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 856-867.

    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:inm:ormoor:v:43:y:2018:i:4:p:1143-1176. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.