{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Finance Notes_Part_4

# Finance Notes_Part_4 - 3 Optimization under general...

This preview shows pages 1–5. Sign up to view the full content.

Classes of algorithms (globally convergent) Line-Search Methods : Aim to get descent along negative simplex gradients (which are intimately related to polynomial models). Examples are the implicit filtering method. Audet and Vicente (SIOPT 2008) Introduction 18/109

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Classes of algorithms (globally convergent) Trust-Region Methods : Minimize trust-region subproblems defined by fully-linear or fully-quadratic models (typically built from interpolation or regression). Examples are methods based on polynomial models or radial basis functions models. Audet and Vicente (SIOPT 2008) Introduction 19/109
Presentation outline 1 Introduction 2 Unconstrained optimization Directional direct search methods Simplicial direct search and line-search methods Interpolation-based trust-region methods

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3 Optimization under general constraints 4 Surrogates, global DFO, software, and references Direct search methods Use the function values directly. Do not require derivatives. Do not attempt to estimate derivatives. Mads is guaranteed to produce solutions that satisfy hierarchical optimality conditions depending on local smoothness of the functions. Examples: DiRect , Mads , Nelder-Mead, Pattern Search. Audet and Vicente (SIOPT 2008) Unconstrained optimization 21/109 Coordinate search (ancestor of pattern search). Consider the unconstrained problem min x ∈ R n f ( x ) where f : R n → R ∪ {∞} . Audet and Vicente (SIOPT 2008) Unconstrained optimization 22/109...
View Full Document

{[ snackBarMessage ]}