Convergence properties of descent methods for unconstrained minization
From MaRDI portal
Recommendations
Cited in
(23)- An estimate of the speed of convergence for certain methods of coordinate descent
- Solution of a research problem on trees of subsets
- Some convergence properties of descent methods
- On the convergence of descent methods
- Convergence of implementable descent algorithms for unconstrained optimization
- An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence
- The method of gradient descent for minimizing non-convex functions
- On the convergence of descent algorithms
- A note on the optimal convergence rate of descent methods with fixed step sizes for smooth strongly convex functions
- scientific article; zbMATH DE number 5846393 (Why is no real title available?)
- A study on the rate of convergence of descent methods
- scientific article; zbMATH DE number 4048294 (Why is no real title available?)
- scientific article; zbMATH DE number 4049405 (Why is no real title available?)
- scientific article; zbMATH DE number 4106165 (Why is no real title available?)
- On Convergence Properties of Algorithms for Unconstrained Minimization
- scientific article; zbMATH DE number 4126611 (Why is no real title available?)
- scientific article; zbMATH DE number 1479856 (Why is no real title available?)
- Convergence analysis of a proximal newton method1
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convergence rate of gradient-concordant methods for smooth unconstrained optimization
- Necessary and sufficient convergence conditions for a class of nonlinear programming methods
- Descent: an optimization point of view on different fields
- Choosing descent directions in unconstrained minimization problems
This page was built for publication: Convergence properties of descent methods for unconstrained minization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327971)