Skip to main content
Log in

Computing the resolvent of the sum of operators with application to best approximation problems

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We propose a flexible approach for computing the resolvent of the sum of weakly monotone operators in real Hilbert spaces. This relies on splitting methods where strong convergence is guaranteed. We also prove linear convergence under Lipschitz continuity assumption. The approach is then applied to computing the proximity operator of the sum of weakly convex functions, and particularly to finding the best approximation to the intersection of convex sets.

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.

Similar content being viewed by others

References

  1. Alwadani, S., Bauschke, H.H., Moursi, W.M., Wang, X.: On the asymptotic behaviour of the Aragón Artacho–Campoy algorithm. Oper. Res. Lett. 46(6), 585–587 (2018)

    Article  MathSciNet  Google Scholar 

  2. Aragón Artacho, F.J., Campoy, R.: Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm. J. Optim. Theory Appl. (2019)

  3. Bauschke, H.H., Combettes, P.L.: A Dykstra-like algorithm for two monotone operators. Pac. J. Optim. 4(3), 383–391 (2008)

    MathSciNet  MATH  Google Scholar 

  4. Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)

    Book  Google Scholar 

  5. Combettes, P.L.: Iterative construction of the resolvent of a sum of maximal monotone operators. J. Convex Anal. 16(3), 727–748 (2009)

    MathSciNet  MATH  Google Scholar 

  6. Dao, M.N., Phan, H.M.: Linear convergence of projection algorithms. Math. Oper. Res. (2018). https://doi.org/10.1287/moor.2018.0942

  7. Dao, M.N., Phan, H.M.: Linear convergence of the generalized Douglas–Rachford algorithm for feasibility problems. J. Glob. Optim. 72(3), 443–474 (2018)

    Article  MathSciNet  Google Scholar 

  8. Dao, M.N., Phan, H.M.: Adaptive Douglas–Rachford splitting algorithm for the sum of two operators (2018). arXiv:1809.00761

  9. Douglas, J., Rachford, H.H.: On the numerical solution of heat conduction problems in two and three space variables. Trans. Am. Math. Soc. 82, 421–439 (1956)

    Article  MathSciNet  Google Scholar 

  10. Dykstra, R.L.: An algorithm for restricted least squares regression. J. Am. Stat. Assoc. 78(384), 837–842 (1983)

    Article  MathSciNet  Google Scholar 

  11. Lions, P.-L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964–979 (1979)

    Article  MathSciNet  Google Scholar 

  12. Peaceman, D.W., Rachford, H.H.: The numerical solution of parabolic and elliptic differential equations. J. Soc. Ind. Appl. Math. 3, 28–41 (1955)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors thank two anonymous referees for their careful reading and helpful comments. MND was partially supported by Discovery Project 160101537 from the Australian Research Council. HMP was partially supported by Autodesk, Inc. via a gift made to the Department of Mathematical Sciences, University of Massachusetts Lowell.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hung M. Phan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dao, M.N., Phan, H.M. Computing the resolvent of the sum of operators with application to best approximation problems. Optim Lett 14, 1193–1205 (2020). https://doi.org/10.1007/s11590-019-01432-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-019-01432-x

Keywords

Navigation