A subgradient projection algorithm

DOI10.1016/0021-9045(82)90029-6zbMath0486.65042OpenAlexW4213266764MaRDI QIDQ1164968

V. P. Sreedharan

Publication date: 1982

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(82)90029-6

zbMATH Keywords

global convergencedescent methodsubgradient projectionnon-differentiable convex optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

A least distance algorithm for a smooth strictly convex norm ⋮ Extensions of subgradient projection algorithms ⋮ \(\epsilon\)-subgradient projection algorithm ⋮ An algorithm for non-negative norm minimal solutions ⋮ An active set method for solving linearly constrained nonsmooth optimization problems ⋮ An algorithm for constrained convex optimization ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ Implementation of a subgradient projection algorithm ⋮ Subgradient projection algorithm. II ⋮ Implementation of a subgradient projection algorithm II

Cites Work

• Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
• Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• Implementation of a subgradient projection algorithm
• A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A subgradient projection algorithm