IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v175y2017i3d10.1007_s10957-017-1188-y.html
   My bibliography  Save this article

An Inexact Spingarn’s Partial Inverse Method with Applications to Operator Splitting and Composite Optimization

Author

Listed:
  • Maicon Marques Alves

    (Universidade Federal de Santa Catarina)

  • Samara Costa Lima

    (Universidade Federal de Santa Catarina)

Abstract

We propose and study the iteration-complexity of an inexact version of the Spingarn’s partial inverse method. Its complexity analysis is performed by viewing it in the framework of the hybrid proximal extragradient method, for which pointwise and ergodic iteration-complexity has been established recently by Monteiro and Svaiter. As applications, we propose and analyze the iteration-complexity of an inexact operator splitting algorithm—which generalizes the original Spingarn’s splitting method—and of a parallel forward–backward algorithm for multi-term composite convex optimization.

Suggested Citation

  • Maicon Marques Alves & Samara Costa Lima, 2017. "An Inexact Spingarn’s Partial Inverse Method with Applications to Operator Splitting and Composite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 175(3), pages 818-847, December.
    • Handle: RePEc:spr:joptap:v:175:y:2017:i:3:d:10.1007_s10957-017-1188-y
    DOI: 10.1007/s10957-017-1188-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-017-1188-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/s10957-017-1188-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. Renato D. C. Monteiro & Camilo Ortiz & Benar F. Svaiter, 2016. "An adaptive accelerated first-order method for convex optimization," Computational Optimization and Applications, Springer, vol. 64(1), pages 31-73, May.
    2. M. V. Solodov & B. F. Svaiter, 2000. "An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions," Mathematics of Operations Research, INFORMS, vol. 25(2), pages 214-230, May.
    3. Renato Monteiro & Camilo Ortiz & Benar Svaiter, 2014. "Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems," Computational Optimization and Applications, Springer, vol. 57(1), pages 45-69, January.
    4. L. C. Ceng & B. S. Mordukhovich & J. C. Yao, 2010. "Hybrid Approximate Proximal Method with Auxiliary Variational Inequality for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 267-303, 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. Mauricio Romero Sicre, 2020. "On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems," Computational Optimization and Applications, Springer, vol. 76(3), pages 991-1019, July.
    2. Thai Chuong, 2013. "Newton-like methods for efficient solutions in vector optimization," Computational Optimization and Applications, Springer, vol. 54(3), pages 495-516, April.
    3. Weiwei Kong & Jefferson G. Melo & Renato D. C. Monteiro, 2020. "An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems," Computational Optimization and Applications, Springer, vol. 76(2), pages 305-346, June.
    4. William W. Hager & Hongchao Zhang, 2020. "Convergence rates for an inexact ADMM applied to separable convex optimization," Computational Optimization and Applications, Springer, vol. 77(3), pages 729-754, December.
    5. Xiaolong Qin & Shin Kang & Yeol Cho, 2010. "Approximating zeros of monotone operators by proximal point algorithms," Journal of Global Optimization, Springer, vol. 46(1), pages 75-87, January.
    6. Gonçalves, M.L.N. & Lima, F.S. & Prudente, L.F., 2022. "A study of Liu-Storey conjugate gradient methods for vector optimization," Applied Mathematics and Computation, Elsevier, vol. 425(C).
    7. Renato D. C. Monteiro & Chee-Khian Sim, 2018. "Complexity of the relaxed Peaceman–Rachford splitting method for the sum of two maximal strongly monotone operators," Computational Optimization and Applications, Springer, vol. 70(3), pages 763-790, July.
    8. William W. Hager & Hongchao Zhang, 2019. "Inexact alternating direction methods of multipliers for separable convex optimization," Computational Optimization and Applications, Springer, vol. 73(1), pages 201-235, May.
    9. Bento, G.C. & Cruz Neto, J.X. & Oliveira, P.R. & Soubeyran, A., 2014. "The self regulation problem as an inexact steepest descent method for multicriteria optimization," European Journal of Operational Research, Elsevier, vol. 235(3), pages 494-502.
    10. 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.
    11. Glaydston Carvalho Bento & Sandro Dimy Barbosa Bitar & João Xavier Cruz Neto & Antoine Soubeyran & João Carlos Oliveira Souza, 2020. "A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems," Computational Optimization and Applications, Springer, vol. 75(1), pages 263-290, January.
    12. Weiwei Kong & Renato D. C. Monteiro, 2022. "Accelerated inexact composite gradient methods for nonconvex spectral optimization problems," Computational Optimization and Applications, Springer, vol. 82(3), pages 673-715, July.
    13. 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.
    14. Maicon Marques Alves & B. F. Svaiter, 2016. "A Variant of the Hybrid Proximal Extragradient Method for Solving Strongly Monotone Inclusions and its Complexity Analysis," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 198-215, January.
    15. G. C. Bento & J. X. Cruz Neto & L. V. Meireles & A. Soubeyran, 2022. "Pareto solutions as limits of collective traps: an inexact multiobjective proximal point algorithm," Annals of Operations Research, Springer, vol. 316(2), pages 1425-1443, September.
    16. Donghwan Kim & Jeffrey A. Fessler, 2018. "Adaptive Restart of the Optimized Gradient Method for Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 178(1), pages 240-263, July.
    17. Alfredo N. Iusem & Jefferson G. Melo & Ray G. Serra, 2021. "A Strongly Convergent Proximal Point Method for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 190(1), pages 183-200, July.
    18. Brendan O’Donoghue & Eric Chu & Neal Parikh & Stephen Boyd, 2016. "Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 1042-1068, June.
    19. Ceng, Lu-Chuan & Yao, Jen-Chih, 2007. "Approximate proximal methods in vector optimization," European Journal of Operational Research, Elsevier, vol. 183(1), pages 1-19, November.
    20. Lu-Chuan Ceng & Nicolas Hadjisavvas & Ngai-Ching Wong, 2010. "Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems," Journal of Global Optimization, Springer, vol. 46(4), pages 635-646, April.

    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:joptap:v:175:y:2017:i:3:d:10.1007_s10957-017-1188-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.