scientific article; zbMATH DE number 3905760

MaRDI QIDQ3683447zbMATH OpenFDO

Authors Vladimir N. Krutikov

Publication date 1981

zbMATH Keywords

canyon functionsconvergence ratecyclicdescent methodsrandom

Mathematics Subject Classification ID

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

Recommendations

• Analyzing random permutations for cyclic coordinate descent
• Random permutations fix a worst case for cyclic coordinate descent
• Efficiency of coordinate descent methods on huge-scale optimization problems
• On the complexity analysis of randomized block-coordinate descent methods
• On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods

Cited in

(4)

• Worst-case complexity of cyclic coordinate descent: O(n^2) gap with randomized version
• Analyzing random permutations for cyclic coordinate descent
• On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods
• Random permutations fix a worst case for cyclic coordinate descent

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 Q3683447)