Inexact proximal methods for weakly convex functions
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Generalized Newton Method for Subgradient Systems
- A Singular Value Thresholding Algorithm for Matrix Completion
- An Invitation to Tame Optimization
- Clarke Subgradients of Stratifiable Functions
- Compressed Sensing Performance Bounds Under Poisson Noise
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convex analysis and beyond. Volume I. Basic theory
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Generalized damped Newton algorithms in nonsmooth optimization via second-order subdifferentials
- Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 1817650 (Why is no real title available?)
- scientific article; zbMATH DE number 45943 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3272538 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- Inexact reduced gradient methods in nonconvex optimization
- iPiano: inertial proximal algorithm for nonconvex optimization
- Lectures on convex optimization
- Monotone Operators and the Proximal Point Algorithm
- Nonlinear programming
- On Chebyshev functions and Klee functions
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal methods avoid active strict saddles of weakly convex functions
- Second-order variational analysis in optimization, variational stability, and control. Theory, algorithms, applications
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Total Variation Projection With First Order Schemes
- Variable smoothing for weakly convex composite functions
- Variational Analysis
- Variational analysis and applications
Cited in
(8)- A projected variable smoothing for weakly convex optimization and supremum functions
- Local convergence analysis for nonisolated solutions to derivative-free methods of optimization
- Convergence of first-order algorithms with momentum from the perspective of an inexact gradient descent method
- Local minimizers of nonconvex functions in Banach spaces via Moreau envelopes
- A fast primal-dual algorithm via dynamical system with variable mass for linearly constrained convex optimization
- New Globalized Newton-Type Methods for Nonconvex Optimization Problems
- Linear convergence of the proximal gradient method for composite optimization under the Polyak-Łojasiewicz inequality and its variant
- Globally convergent derivative-free methods in nonconvex optimization with and without noise
This page was built for publication: Inexact proximal methods for weakly convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7008127)
