Oscillatory Descent for Function Minimization

Roger Brockett
Additional contact information
Roger Brockett: Harvard University, Division of Engineering and Applied Sciences

A chapter in Current and Future Directions in Applied Mathematics, 1997, pp 65-82 from Springer

Abstract: Abstract Algorithms for minimizing a function based on continuous descent methods following the gradient relative to some riemannian metric suffer from the twin problems of converging to local, rather than global, minima and giving little indication about an approximate answer until the process has nearly converged. Simulated annealing addresses these problems through the introduction of stochastic terms, however the rate of convergence associated with the method can be unacceptably slow. In this paper we discuss a modification of simulated annealing which approaches a minimum through a damped oscillatory path. The characteristics of the path, including its tendency to be irregular, reflect the properties of the function being minimized. The oscillatory algorithm involves both a temperature and coupling parameters, giving it considerable flexibility.

Keywords: Null Space; Simulated Annealing Algorithm; Function Minimization; Coadjoint Orbit; Stochastic Term (search for similar items in EconPapers)
Date: 1997
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:sprchp:978-1-4612-2012-1_12

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

DOI: 10.1007/978-1-4612-2012-1_12

Access Statistics for this chapter

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