First-order primal-dual methods for nonsmooth non-convex optimization
From MaRDI portal
Recommendations
- A primal-dual smoothing framework for max-structured non-convex optimization
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- New primal-dual algorithms for a class of nonsmooth and nonlinear convex-concave minimax problems
- An efficient primal dual prox method for non-smooth optimization
- A smooth primal-dual optimization framework for nonsmooth composite convex minimization
Cites work
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 1448982 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex analysis and optimization in Hadamard spaces
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- First-order methods in optimization
- Optical imaging
Cited in
(3)
This page was built for publication: First-order primal-dual methods for nonsmooth non-convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606458)