A Dykstra-like algorithm for two monotone operators

@inproceedings{Bauschke2008ADA,
  title={A Dykstra-like algorithm for two monotone operators},
  author={Heinz H. Bauschke and Patrick L. Combettes},
  year={2008}
}
Dykstra’s algorithm employs the projectors onto two closed convex sets in a Hilbert space to construct iteratively the projector onto their intersection. In this paper, we use a duality argument to devise an extension of this algorithm for constructing the resolvent of the sum of two maximal monotone operators from the individual resolvents. This result is sharpened to obtain the construction of the proximity operator of the sum of two proper lower semicontinuous convex functions. 2000… CONTINUE READING
Highly Cited
This paper has 38 citations. REVIEW CITATIONS
27 Citations
26 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 26 references

An alternating projection that does not converge in norm

  • H. S. Hundal
  • Nonlinear Anal. 57
  • 2004
1 Excerpt

Convex Analysis in General Vector Spaces

  • C. Zălinescu
  • World Scientific, River Edge, NJ
  • 2002
1 Excerpt

Best Approximation in Inner Product Spaces

  • F. Deutsch
  • Springer-Verlag, New York
  • 2001
1 Excerpt

Minimax and Monotonicity

  • S. Simons
  • Lecture Notes in Mathematics 1693. Springer…
  • 1998
1 Excerpt

Dykstra’s alternating projection algorithm for two sets

  • H. H. Bauschke, J. M. Borwein
  • J. Approx. Theory 79
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…