Stepsize analysis for descent methods
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3302906 (Why is no real title available?)
- scientific article; zbMATH DE number 3313108 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- Cauchy's method of minimization
- Convergence Conditions for Ascent Methods
- Gradient methods of maximization
- Minimization of functions having Lipschitz continuous first partial derivatives
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On the Relative Efficiencies of Gradient Methods
- Some inequalities involving the euclidean condition of a matrix
Cited in
(19)- Modified nonmonotone Armijo line search for descent method
- Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds
- A new class of memory gradient methods with inexact line searches
- Computer Algebra and Line Search
- Memory gradient method with Goldstein line search
- Convergence of descent method without line search
- A gradient-related algorithm with inexact line searches
- A new super-memory gradient method with curve search rule
- A new descent algorithm with curve search rule
- Solution of location problems with radial cost functions
- New inexact line search method for unconstrained optimization
- Accelerating convergence in minisum location problem with \(\ell p\) norms
- On the convergence of the descent methods
- A note on the optimal convergence rate of descent methods with fixed step sizes for smooth strongly convex functions
- Convergence of line search methods for unconstrained optimization
- Comparing gradient descent with automatic differentiation and particle swarm optimization techniques for estimating tumor blood flow parameters in contrast-enhanced imaging
- Accelerating convergence in the Fermat-Weber location problem
- A survey of gradient methods for solving nonlinear optimization
- New cautious BFGS algorithm based on modified Armijo-type line search
This page was built for publication: Stepsize analysis for descent methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1133148)
