LINE SEARCH DESCENT METHODS FOR UNCONSTRAINED MINIMIZATION

Jan A. Snyman () and Daniel N. Wilke ()
Additional contact information
Jan A. Snyman: University of Pretoria
Daniel N. Wilke: University of Pretoria

Chapter Chapter 2 in Practical Mathematical Optimization, 2018, pp 41-69 from Springer

Abstract: Abstract Over the last 40 years many powerful direct search algorithms have been developed for the unconstrained minimization of general functions. These algorithms require an initial estimate to the optimum point, denoted by $$\mathbf{x}^0$$ . With this estimate as starting point, the algorithm generates a sequence of estimates $$\mathbf{x}^0$$ , $$\mathbf{x}^1$$ , $$\mathbf{x}^2$$ , $$\dots $$ , by successively searching directly from each point in a direction of descent to determine the next point. The process is terminated if either no further progress is made, or if a point $$\mathbf{x}^k$$ is reached (for smooth functions) at which the first necessary condition in, i.e. $${\varvec{\nabla }} f(\mathbf{x})=\mathbf{0}$$ is sufficiently accurately satisfied, in which case $$\mathbf{x}^*\cong \mathbf{x}^k$$ . It is usually, although not always, required that the function value at the new iterate $$\mathbf{x}^{i+1}$$ be lower than that at $$\mathbf{x}^i$$ .

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-77586-9_2

Ordering information: This item can be ordered from
http://www.springer.com/9783319775869

DOI: 10.1007/978-3-319-77586-9_2

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().