Nonsmooth Analysis and Optimization
Not on the map. Why?
Abstract (arXiv)
These lecture notes for a graduate course cover generalized derivative concepts useful in deriving necessary optimality conditions and numerical algorithms for nondifferentiable optimization problems in inverse problems, imaging, and PDE-constrained optimization. Treated are convex functions and subdifferentials, Fenchel duality, monotone operators and resolvents, Moreau--Yosida regularization, proximal point and (some) first-order splitting methods, Clarke subdifferentials, and semismooth Newton methods. The required background from functional analysis and calculus of variations is also briefly summarized.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Aug 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 2.
5 papers.
- 2022Theoretical Perspectives on Deep Learning Methods in Inverse Problemscited by 22
- 2022Signal Recovery with Non-Expansive Generative Network Priorscited by 1
- 2024Exact Recovery Guarantees for Parameterized Nonlinear System Identification Problem under Sparse Disturbances or Semi-Oblivious Attackscited by 1
- 2021Screening for a Reweighted Penalized Conditional Gradient Methodcited by 0
- 2024Accelerated Fully First-Order Methods for Bilevel and Minimax Optimizationcited by 0
- 2024Exact Recovery Guarantees for Parameterized Nonlinear System Identification Problem under Sparse Disturbances or Semi-Oblivious Attacks30 Aug 2024
- 2024Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization1 May 2024
- 2022Theoretical Perspectives on Deep Learning Methods in Inverse Problems29 Jun 2022
- 2022Signal Recovery with Non-Expansive Generative Network Priors24 Apr 2022
- 2021Screening for a Reweighted Penalized Conditional Gradient Method2 Jul 2021