First-Order Primal–Dual Methods for Nonsmooth Non-convex Optimization

Tuomo Valkonen ()
Additional contact information
Tuomo Valkonen: Escuela Politécnica Nacional, Center for Mathematical Modeling

Chapter 18 in Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging, 2023, pp 707-748 from Springer

Abstract: Abstract We provide an overview of primal–dual algorithms for nonsmooth and non-convex-concave saddle-point problems. This flows around a new analysis of such methods, using Bregman divergences to formulate simplified conditions for convergence.

Keywords: Primal-dual; Nonsmooth; Nonconvex; Optimization; Inverse problems (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-98661-2_93

Ordering information: This item can be ordered from
http://www.springer.com/9783030986612

DOI: 10.1007/978-3-030-98661-2_93

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().