Extensions of subgradient projection algorithms
From MaRDI portal
Recommendations
- Subgradient projectors: extensions, theory, and characterizations
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- The projected subgradient algorithm in convex optimization
- Subgradient projection algorithm. II
- Implementation of a subgradient projection algorithm II
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- scientific article; zbMATH DE number 3852337
- scientific article; zbMATH DE number 11412
- On subgradient projectors
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
Cites work
- scientific article; zbMATH DE number 51950 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- A subgradient projection algorithm
- Implementation of a subgradient projection algorithm
- Implementation of a subgradient projection algorithm II
- Subgradient projection algorithm. II
Cited in
(7)- A least distance algorithm for a smooth strictly convex norm
- Subgradient projectors: extensions, theory, and characterizations
- An algorithm for approximation by elements of a cone in a banach space
- An algorithm for computing nonnegative minimal norm solutions
- \(\epsilon\)-subgradient projection algorithm
- Subgradient projection algorithm. II
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
This page was built for publication: Extensions of subgradient projection algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089262)