scientific article; zbMATH DE number 4135721

MaRDI QIDQ3468889zbMATH OpenFDO

Authors Christian Homburg

Publication date 1989

zbMATH Keywords

acceleration of algorithmsOettli's algorithmstep size rulesubgradient method

Mathematics Subject Classification ID

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

Recommendations

• A note on the convergence of subgradient optimization methods
• A subgradient algorithm with dynamic step sizes
• Two ``well-known properties of subgradient optimization
• A subgradient method with non-monotone line search
• scientific article; zbMATH DE number 3868523

Cited in

(8)

• An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
• An effective line search for the subgradient method
• A generalized subgradient method with relaxation step
• Subgradient method with Polyak's step in transformed space
• A note on the convergence of subgradient optimization methods
• scientific article; zbMATH DE number 3868523 (Why is no real title available?)
• A generalization of Polyak's convergence result for subgradient optimization
• A subgradient algorithm with dynamic step sizes

This page was built for publication:

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