Skip to main content
Log in

A Variant of the Hybrid Proximal Extragradient Method for Solving Strongly Monotone Inclusions and its Complexity Analysis

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

This paper presents and studies the iteration-complexity of a variant of the hybrid proximal extragradient method for solving inclusion problems with strongly (maximal) monotone operators. As applications, we propose and analyze two special cases: variants of the Tseng’s forward–backward method for solving monotone inclusions with strongly monotone and Lipschitz continuous operators and of the Korpelevich extragradient method for solving (strongly monotone) variational inequalities.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Martinet, B.: Régularisation d’inéquations variationnelles par approximations successives. Rev. Française Inform. Rech. Opérationnelle 4(Ser. R–3), 154–158 (1970)

    MathSciNet  MATH  Google Scholar 

  2. Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14(5), 877–898 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  3. Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Anal. 7(4), 323–345 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Solodov, M.V., Svaiter, B.F.: A hybrid projection-proximal point algorithm. J. Convex Anal. 6(1), 59–70 (1999)

    MathSciNet  MATH  Google Scholar 

  5. Burachik, R.S., Iusem, A., Svaiter, B.F.: Enlargement of monotone operators with applications to variational inequalities. Set-Valued Anal. 5(2), 159–180 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Monteiro, R.D.C., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM J. Optim. 20(6), 2755–2787 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Monteiro, R.D.C., Ortiz, C., Svaiter, B.F.: A first-order block-decomposition method for solving two-easy-block structured semidefinite programs. Math. Program. Comput. 6(2), 103–150 (2014)

    Article  MathSciNet  Google Scholar 

  8. Monteiro, R.D.C., Ortiz, C., Svaiter, B.F.: Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems. Comput. Optim. Appl. 57(1), 45–69 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Monteiro, R.D.C., Svaiter, B.F.: Complexity of variants of Tseng’s modified F-B splitting and Korpelevich’s methods for hemivariational inequalities with applications to saddle-point and convex optimization problems. SIAM J. Optim. 21(4), 1688–1720 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems. SIAM J. Optim. 22(3), 914–935 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Monteiro, R.D.C., Svaiter, B.F.: An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods. SIAM J. Optim. 23(2), 1092–1125 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. SIAM J. Optim. 23(1), 475–507 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  13. Solodov, M.V., Svaiter, B.F.: Forcing strong convergence of proximal point iterations in a Hilbert space. Math. Program. 87(1, Ser. A), 189–202 (2000)

    MathSciNet  MATH  Google Scholar 

  14. Solodov, M.V., Svaiter, B.F.: A truly globally convergent Newton-type method for the monotone nonlinear complementarity problem. SIAM J. Optim. 10(2), 605–625 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Tikhonov, A.N., Arsenin, V.Y.: Solutions of Ill-Posed Problems. Winston and Sons, Washington (1977)

    MATH  Google Scholar 

  16. Nesterov, Y., Scrimali, L.: Solving strongly monotone variational and quasi-variational inequalities. Discret Contin. Dyn. Syst. 31(4), 1383–1396 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  17. Brøndsted, A., Rockafellar, R.T.: On the subdifferentiability of convex functions. Proc. Am. Math. Soc. 16, 605–611 (1965)

    Article  Google Scholar 

Download references

Acknowledgments

M. Marques Alves was partially supported by CNPq Grant Nos. 406250/2013-8, 237068/2013-3 and 306317/2014-1. B. F. Svaiter was partially supported by CNPq Grant Nos. 474996/2013-1, 302962/2011-5 and FAPERJ Grant E-26/201.584/2014.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maicon Marques Alves.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Marques Alves, M., Svaiter, B.F. A Variant of the Hybrid Proximal Extragradient Method for Solving Strongly Monotone Inclusions and its Complexity Analysis. J Optim Theory Appl 168, 198–215 (2016). https://doi.org/10.1007/s10957-015-0792-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-015-0792-y

Keywords

Mathematics Subject Classification

Navigation