Convergence of implementable descent algorithms for unconstrained optimization

DOI10.1023/A:1004602012151zbMath0974.90018OpenAlexW135531879MaRDI QIDQ1573997

Jean-Pierre Dussault

Publication date: 16 December 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004602012151

zbMATH Keywords

global convergencedescent algorithmstepsize rules

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items (4)

Convergence of line search methods for unconstrained optimization ⋮ A robust iterative algorithm for structural reliability analysis ⋮ The gradient and heavy ball with friction dynamical systems: The quasiconvex case ⋮ Algorithms for quasiconvex minimization

Cites Work

• Minimization of functions having Lipschitz continuous first partial derivatives
• A proximal regularization of the steepest descent method
• Convergence Conditions for Ascent Methods

This page was built for publication: Convergence of implementable descent algorithms for unconstrained optimization