On the convergence of the projected gradient method
From MaRDI portal
Recommendations
- Projected gradient methods for linearly constrained problems
- On the convergence of projected gradient processes to singular critical points
- On the convergence properties of the projected gradient method for convex optimization
- Convergence of a projected gradient method variant for quasiconvex objectives
- Subgradient projection algorithm. II
Cites work
Cited in
(14)- Convergence properties of inexact projected gradient methods
- A probe about the unified construction of gradient projection type methods
- scientific article; zbMATH DE number 4043629 (Why is no real title available?)
- The \(L_p\) convergence for projection pursuit regression
- Convergence of one-step projected gradient methods for variational inequalities
- scientific article; zbMATH DE number 4087432 (Why is no real title available?)
- Local Convergence of a Two-Piece Update of a Projected Hessian Matrix
- Monotone variable-metric algorithm for linearly constrained nonlinear programming
- On the convergence properties of the projected gradient method for convex optimization
- An interior point algorithm for global optimal solutions and KKT points
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
- On the Identification Property of a Projected Gradient Method
- On the convergence of projected gradient processes to singular critical points
This page was built for publication: On the convergence of the projected gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321330)
