Unconstrained Optimization

P. E. Frandsen, K. Jonasson, Hans Bruun Nielsen, Ole Tingleff

    Research output: Book/ReportCompendium/lecture notesEducation

    Abstract

    This lecture note is intended for use in the course 04212 Optimization and Data Fitting at the Technincal University of Denmark. It covers about 25% of the curriculum. Hopefully, the note may be useful also to interested persons not participating in that course. The aim of the note is to give an introduction to algorithms for unconstrained optimization. We present Conjugate Gradient, Damped Newton and Quasi Newton methods together with the relevant theoretical background. The reader is assumed to be familiar with algorithms for solving linear and nonlinear system of equations, at a level corresponding to an introductory course in numerical analysis. The algorithms presented in the note appear in any good program library, and implementations can be found via GAMS (Guide to Available Mathematical Software) at the Internet address http://gams.nist.gov The examples in the note were computed in Matlab. The programs are available via http://www.imm.dtu.dk/hbn/software.html
    Original languageEnglish
    Publication statusPublished - 1999

    Bibliographical note

    Available in ps or in pdf format.

    Fingerprint

    Dive into the research topics of 'Unconstrained Optimization'. Together they form a unique fingerprint.

    Cite this