Extensions of subgradient projection algorithms
From MaRDI portal
Publication:1089262
DOI10.1016/0021-9045(86)90031-6zbMATH Open0618.90076OpenAlexW2021537302MaRDI QIDQ1089262FDOQ1089262
Authors: V. P. Sreedharan 
Publication date: 1986
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(86)90031-6
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†
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Cites Work
Cited In (7)
- Subgradient projectors: extensions, theory, and characterizations
- \(\epsilon\)-subgradient projection algorithm
- An algorithm for computing nonnegative minimal norm solutions
- A least distance algorithm for a smooth strictly convex norm
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
- An algorithm for approximation by elements of a cone in a banach space
- Subgradient projection algorithm. II
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)
