IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v82y2022i2d10.1007_s10898-021-01057-4.html
   My bibliography  Save this article

Conical averagedness and convergence analysis of fixed point algorithms

Author

Listed:
  • Sedi Bartz

    (University of Massachusetts Lowell)

  • Minh N. Dao

    (Federation University Australia)

  • Hung M. Phan

    (University of Massachusetts Lowell)

Abstract

We study a conical extension of averaged nonexpansive operators and the role it plays in convergence analysis of fixed point algorithms. Various properties of conically averaged operators are systematically investigated, in particular, the stability under relaxations, convex combinations and compositions. We derive conical averagedness properties of resolvents of generalized monotone operators. These properties are then utilized in order to analyze the convergence of the proximal point algorithm, the forward–backward algorithm, and the adaptive Douglas–Rachford algorithm. Our study unifies, improves and casts new light on recent studies of these topics.

Suggested Citation

  • Sedi Bartz & Minh N. Dao & Hung M. Phan, 2022. "Conical averagedness and convergence analysis of fixed point algorithms," Journal of Global Optimization, Springer, vol. 82(2), pages 351-373, February.
    • Handle: RePEc:spr:jglopt:v:82:y:2022:i:2:d:10.1007_s10898-021-01057-4
    DOI: 10.1007/s10898-021-01057-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-021-01057-4
    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/s10898-021-01057-4?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. Regina S. Burachik & Alfredo N. Iusem, 2008. "Set-Valued Mappings and Enlargements of Monotone Operators," Springer Optimization and Its Applications, Springer, number 978-0-387-69757-4, September.
    2. Minh N. Dao & Matthew K. Tam, 2019. "Union Averaged Operators with Applications to Proximal Algorithms for Min-Convex Functions," Journal of Optimization Theory and Applications, Springer, vol. 181(1), pages 61-94, April.
    3. Jean-Philippe Vial, 1983. "Strong and Weak Convexity of Sets and Functions," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 231-259, May.
    4. Regina S. Burachik & Alfredo N. Iusem, 2008. "Enlargements of Monotone Operators," Springer Optimization and Its Applications, in: Set-Valued Mappings and Enlargements of Monotone Operators, chapter 0, pages 161-220, Springer.
    5. VIAL, Jean-Philippe, 1983. "Strong and weak convexity of sets and functions," LIDAM Reprints CORE 529, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    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. Chee-Khian Sim, 2023. "Convergence Rates for the Relaxed Peaceman-Rachford Splitting Method on a Monotone Inclusion Problem," Journal of Optimization Theory and Applications, Springer, vol. 196(1), pages 298-323, January.
    2. Sedi Bartz & Rubén Campoy & Hung M. Phan, 2022. "An Adaptive Alternating Direction Method of Multipliers," Journal of Optimization Theory and Applications, Springer, vol. 195(3), pages 1019-1055, December.

    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. Maćkowiak, Piotr, 2009. "Adaptive Rolling Plans Are Good," MPRA Paper 42043, University Library of Munich, Germany.
    2. Sorger, Gerhard, 2004. "Consistent planning under quasi-geometric discounting," Journal of Economic Theory, Elsevier, vol. 118(1), pages 118-129, September.
    3. Sorin-Mihai Grad & Felipe Lara, 2022. "An extension of the proximal point algorithm beyond convexity," Journal of Global Optimization, Springer, vol. 82(2), pages 313-329, February.
    4. Huynh Ngai & Nguyen Huu Tron & Nguyen Vu & Michel Théra, 2022. "Variational Analysis of Paraconvex Multifunctions," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 180-218, June.
    5. J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
    6. Altannar Chinchuluun & Panos Pardalos, 2007. "A survey of recent developments in multiobjective optimization," Annals of Operations Research, Springer, vol. 154(1), pages 29-50, October.
    7. Meena K. Bector & I. Husain & S. Chandra & C. R. Bector, 1988. "A duality model for a generalized minmax program," Naval Research Logistics (NRL), John Wiley & Sons, vol. 35(5), pages 493-501, October.
    8. T. R. Gulati & I. Ahmad & D. Agarwal, 2007. "Sufficiency and Duality in Multiobjective Programming under Generalized Type I Functions," Journal of Optimization Theory and Applications, Springer, vol. 135(3), pages 411-427, December.
    9. Venditti Alain, 2019. "Competitive equilibrium cycles for small discounting in discrete-time two-sector optimal growth models," Studies in Nonlinear Dynamics & Econometrics, De Gruyter, vol. 23(4), pages 1-14, September.
    10. D. H. Yuan & X. L. Liu & A. Chinchuluun & P. M. Pardalos, 2006. "Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity," Journal of Optimization Theory and Applications, Springer, vol. 129(1), pages 185-199, April.
    11. A. Iusem & F. Lara, 2022. "Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 443-461, June.
    12. S. Nobakhtian, 2006. "Sufficiency in Nonsmooth Multiobjective Programming Involving Generalized (Fρ)-convexity," Journal of Optimization Theory and Applications, Springer, vol. 130(2), pages 361-367, August.
    13. Alain Venditti, 2012. "Weak concavity properties of indirect utility functions in multisector optimal growth models," International Journal of Economic Theory, The International Society for Economic Theory, vol. 8(1), pages 13-26, March.
    14. Tadeusz Antczak, 2021. "A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems," Computational Management Science, Springer, vol. 18(1), pages 49-71, January.
    15. Jen-Chwan Liu & Chun-Yu Liu, 2013. "Optimality and Duality for Multiobjective Fractional Programming Involving Nonsmooth Generalized -Univex Functions," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2013, pages 1-10, November.
    16. Huynh Van Ngai & Nguyen Huu Tron & Michel Théra, 2014. "Metric Regularity of the Sum of Multifunctions and Applications," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 355-390, February.
    17. Dawan Chumpungam & Panitarn Sarnmeta & Suthep Suantai, 2021. "A New Forward–Backward Algorithm with Line Searchand Inertial Techniques for Convex Minimization Problems with Applications," Mathematics, MDPI, vol. 9(13), pages 1-20, July.
    18. Hong Yang & Angang Cui, 2023. "The Sufficiency of Solutions for Non-smooth Minimax Fractional Semi-Infinite Programming with ( B K ,ρ )−Invexity," Mathematics, MDPI, vol. 11(20), pages 1-13, October.
    19. S. Nobakhtian, 2008. "Generalized (F,ρ)-Convexity and Duality in Nonsmooth Problems of Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 136(1), pages 61-68, January.
    20. Sorger, Gerhard, 1995. "On the sensitivity of optimal growth paths," Journal of Mathematical Economics, Elsevier, vol. 24(4), pages 353-369.

    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:jglopt:v:82:y:2022:i:2:d:10.1007_s10898-021-01057-4. 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.