Convergence rate of gradient-concordant methods for smooth unconstrained optimization

DOI10.1007/978-3-031-47859-8_3MaRDI QIDQ6588729zbMATH OpenFDO

Authors Alexey Chernov, Anna Lisachenko

Publication date 16 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47859-8_3

zbMATH Keywords

convergence rateconvex optimizationgradient methodsgradient-concordant methodsnon-convex optimizationPolyak-Łojasiewicz condition

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Recommendations

• On the convergence of a wide range of trust region methods for unconstrained optimization
• Strong global convergence of an adaptive nonmonotone memory gradient method
• Convergence properties of descent methods for unconstrained minization
• A linearly convergent conjugate gradient method for unconstrained optimization problems
• Convergence and stability of line search methods for unconstrained optimization

Cites work

• Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition
• Efficiency of coordinate descent methods on huge-scale optimization problems
• scientific article; zbMATH DE number 3972626 (Why is no real title available?)
• scientific article; zbMATH DE number 3313108 (Why is no real title available?)
• scientific article; zbMATH DE number 3371284 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)

Cited in

(1)

• Properties and practicability of convergence-guaranteed optimization methods derived from weak discrete gradients

This page was built for publication: Convergence rate of gradient-concordant methods for smooth unconstrained optimization

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