Skip to main content
SpringerLink
Log in
Book cover

Convex Analysis and Monotone Operator Theory in Hilbert Spaces pp 515–534Cite as

Proximal Minimization

  • Chapter
  • First Online:

  • 7253 Accesses

Part of the book series: CMS Books in Mathematics ((CMSBM))

Abstract

We saw in Chapter 27 that the solutions to minimization problems can be characterized by fixed point equations involving proximity operators. Since proximity operators are firmly nonexpansive, they can be used to devise efficient operator splitting algorithms to solve minimization problems. Such algorithms, called proximal algorithms, are investigated in this chapter.

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

Author information

Authors and Affiliations

  1. Department of Mathematics, University of British Columbia, Kelowna, BC, Canada

    Heinz H. Bauschke

  2. Department of Mathematics, North Carolina State University, Raleigh, NC, USA

    Patrick L. Combettes

Authors
  1. Heinz H. Bauschke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick L. Combettes
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Bauschke, H.H., Combettes, P.L. (2017). Proximal Minimization. In: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-48311-5_28

Download citation

Publish with us

Policies and ethics

Search

Navigation