Test environment running 7.6.6

Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Convergence of the iterates of descent methods for analytic cost functions

Date

Authors

Absil, P-A

Mahony, Robert

Andrews, Benjamin

Publisher

Society for Industrial and Applied Mathematics

Abstract

In the early eighties Lojasiewicz [in Seminari di Geometric, 1982-1983, Università di Bologna, Istituto di Geometria, Dipartimento di Matematica, 1984, pp. 115-117] proved that a bounded solution of a gradient flow for an analytic cost function converges

Keywords

Keywords: Algorithms; Boundary conditions; Costs; Functions; Iterative methods; Numerical methods; Optimization; Descent methods; Gradient flows; Line search; Lojasiewicz gradient inequality; Mexican hat; Real analytic functions; Single limit-point convergence; Tru Descent methods; Gradient flows; Line search; Lojasiewicz gradient inequality; Mexican hat; Real analytic functions; Single limit-point convergence; Trust region

URI

http://hdl.handle.net/1885/79167

Collections

Open Access Research

Source

SIAM Journal on Optimization

Type

Journal article

DOI

10.1137/040605266

Restricted until

2037-12-31

Downloads

File

Description

01_Absil_Convergence_of_the_iterates_of_2005.pdf (276.64 KB)

abcd