On Poljak's improved subgradient method
From MaRDI portal
Recommendations
- Subgradient method with Polyak's step in transformed space
- A generalization of Polyak's convergence result for subgradient optimization
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
- An optimal extension of the Polak-Ribière-Polyak conjugate gradient method
- Polynomial acceleration of iterative schemes associated with subproper splittings
- An improved subgradient method for constrained nondifferentiable optimization
- A descent extension of the Polak-Ribière-Polyak conjugate gradient method
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- Subgradient methods for saddle-point problems
- On the strong convergence of a sufficient descent Polak-Ribière-Polyak conjugate gradient method
Cites work
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- A least-distance programming procedure for minimization problems under linear constraints
- An aggregate subgradient method for nonsmooth convex minimization
- Finding the nearest point in A polytope
- Minimization of unsmooth functionals
Cited in
(6)- A generalization of Polyak's convergence result for subgradient optimization
- Subgradient method with Polyak's step in transformed space
- A modified subgradient algorithm for Lagrangean relaxation
- Optimal prioritized channel allocation in cellular mobile systems
- Channel allocation in cellular radio networks
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
This page was built for publication: On Poljak's improved subgradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090617)
