Convergence of subgradient methods of minimizing convex functions

DOI10.1007/BF01095647MaRDI QIDQ1115809zbMATH OpenFDO

Authors M. I. Kreinin

Publication date 1988

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01095647

zbMATH Keywords

algorithmconvergence accelerationconvex nonsmooth functionsnondifferentiable programmingShor-Polyak subgradient minimization methodunconstrained minimization

Mathematics Subject Classification ID

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

Cites work

• Convex Analysis

Cited in

(5)

• Convergence of a subgradient method for computing the bound norm of matrices
• A method for minimizing convex functions based on continuous approximations to the subdifferential
• scientific article; zbMATH DE number 3995464 (Why is no real title available?)
• Convergence of Minimal Sets in Convex Vector Optimization
• Convergence properties of the modified subgradient method of camerini et al

This page was built for publication: Convergence of subgradient methods of minimizing convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115809)