On Convergence Properties of Algorithms for Unconstrained Minimization

DOI10.1093/imanum/9.3.435zbMath0686.65032OpenAlexW2090175728MaRDI QIDQ4205014

Michael J. Todd

Publication date: 1989

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/imanum/9.3.435

zbMATH Keywords

algorithmsconvergenceconvexityunconstrained minimization

Mathematics Subject Classification ID

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

Related Items (13)

Convergence of quasi-Newton method with new inexact line search ⋮ Convergence of line search methods for unconstrained optimization ⋮ New inexact line search method for unconstrained optimization ⋮ How to deal with the unbounded in optimization: Theory and algorithms ⋮ Some convergence properties of descent methods ⋮ A modified Frank-Wolfe algorithm and its convergence properties ⋮ Descentwise inexact proximal algorithms for smooth optimization ⋮ The extended generalized lambda distribution system for fitting distributions to data: history, completion of theory, tables, applications, the “final word” on moment fits ⋮ The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients ⋮ Modified nonmonotone Armijo line search for descent method ⋮ Convergence of nonmonotone line search method ⋮ On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems ⋮ Convergence of descent method with new line search

This page was built for publication: On Convergence Properties of Algorithms for Unconstrained Minimization