Nonsmooth Analysis and Optimization
arXiv:1708.04180
Abstract
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.
arXiv commentLecture notes
Cited by in corpus (19)
- Nonconvex Nonsmooth Low-Rank Minimization via Iteratively Reweighted Nuclear Norm
- Generalized Nonconvex Nonsmooth Low-Rank Minimization
- Generalized Singular Value Thresholding
- Minimax-robust estimation problems for stationary stochastic sequences
- Joint Design of RF and gradient waveforms via auto-differentiation for 3D tailored excitation in MRI
- A Provably Convergent Scheme for Compressive Sensing under Random Generative Priors
- Filtering Problem for Functionals of Stationary Sequences
- Proximal Iteratively Reweighted Algorithm with Multiple Splitting for Nonconvex Sparsity Optimization
- Optimal control of the principal coefficient in a scalar wave equation
- On the differentiability of directionally differentiable functions and applications
- Nonasymptotic Guarantees for Spiked Matrix Recovery with Generative Priors
- A Trust-Region Method For Nonsmooth Nonconvex Optimization
- Subgradients of Minimal Time Functions without Calmness
- Filtering of Continuous Time Periodically Correlated Isotropic Random Fields
- Minimax Extrapolation Problem For Harmonizable Stable Sequences With Noise Observations
- Finite Codimensional Controllability, and Optimal Control Problems with Endpoint State Constraints
- A proximal dual semismooth Newton method for computing zero-norm penalized QR estimator
- An Efficient Augmented Lagrangian Method with Semismooth Newton Solver for Total Generalized Variation
- Convex Analysis of Minimal Time and Signed Minimal Time Functions