A subgradient algorithm with dynamic step sizes

MaRDI QIDQ5234754zbMATH OpenFDO

Authors Tingting Zhao, Xiangmei Wang

Publication date 2 October 2019

zbMATH Keywords

convex optimizationdynamic step size rulesubgradient method

Mathematics Subject Classification ID

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

Recommendations

• Publication:3468889
• A note on the convergence of subgradient optimization methods
• On convergence of the stochastic subgradient method with on-line stepsize rules
• A subgradient method with non-monotone line search
• A generalization of Polyak's convergence result for subgradient optimization

Cited in

(5)

• An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
• An effective line search for the subgradient method
• scientific article; zbMATH DE number 4135721 (Why is no real title available?)
• A generalization of Polyak's convergence result for subgradient optimization
• Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations

This page was built for publication: A subgradient algorithm with dynamic step sizes

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