Primal-dual algorithm for weakly convex functions under sharpness conditions
From MaRDI portal
Cites work
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based on the Augmented Lagrangian
- A primal-dual algorithm with line search for general convex-concave saddle point problems
- A primal-dual hybrid gradient method for nonlinear operators with applications to MRI
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A symmetric version of the generalized Chambolle-Pock-He-Yuan method for saddle point problems
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Alternating and parallel proximal gradient methods for nonsmooth, nonconvex minimax: a unified convergence analysis
- An algorithm for total variation minimization and applications
- Beyond a Gaussian Denoiser: Residual Learning of Deep CNN for Image Denoising
- Convergence analysis of primal-dual algorithms for a saddle-point problem: from contraction perspective
- Convergence Rate Analysis of Primal-Dual Splitting Schemes
- Convex analysis and monotone operator theory in Hilbert spaces
- Error bounds revisited
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- Faster subgradient methods for functions with Hölderian growth
- First-order convergence theory for weakly-convex-weakly-concave min-max problems
- scientific article; zbMATH DE number 3626130 (Why is no real title available?)
- scientific article; zbMATH DE number 3413412 (Why is no real title available?)
- scientific article; zbMATH DE number 966291 (Why is no real title available?)
- Nonconvex Sparse Logistic Regression With Weakly Convex Regularization
- On duality for nonconvex minimization problems within the framework of abstract convexity
- On the convergence of primal-dual hybrid gradient algorithm
- Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm
- Primal-dual block-proximal splitting for a class of non-convex problems
- Primal-dual proximal splitting and generalized conjugation in non-smooth non-convex optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Quadratic error bound of the smoothed gap and the restarted averaged primal-dual hybrid gradient
- Semiconcave functions, Hamilton-Jacobi equations, and optimal control
- Signal Recovery by Proximal Forward-Backward Splitting
- Subgradient methods for sharp weakly convex functions
- The equivalence of three types of error bounds for weakly and approximately convex functions
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
- WARPd: a linearly convergent first-order primal-dual algorithm for inverse problems with approximate sharpness conditions
- Weakly-convex-concave min-max optimization: provable algorithms and applications in machine learning
This page was built for publication: Primal-dual algorithm for weakly convex functions under sharpness conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325390)
