The indefinite proximal gradient method
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A diagonal quasi-Newton updating method for unconstrained optimization
- A generalized proximal point algorithm for certain non-convex minimization problems
- A proximal quasi-Newton trust-region method for nonsmooth regularized optimization
- A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations
- Adaptive subgradient methods for online learning and stochastic optimization
- An acceleration of proximal diagonal Newton method
- Compressed sensing
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- First-order methods in optimization
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- On ``relaxation-oscillations.
- On quasi-Newton forward-backward splitting: proximal calculus and convergence
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
- Sizing and Least-Change Secant Methods
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Quasi-Cauchy Relation and Diagonal Updating
- Trust Region Methods
- Variational Analysis
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
Cited in
(2)
This page was built for publication: The indefinite proximal gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969548)
