Finance Notes_Part_31

Finance Notes_Part_31 - meshes that get innitely ne. If f...

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

View Full Document Right Arrow Icon
OrthoMads : Householder orthogonal matrix The Householder transformation is then applied to the integer direction q : H = k q k 2 I n - 2 qq T , where I n is the identity matrix. By construction, H is an integer orthogonal basis of R n . The poll directions for OrthoMads are defined to be the columns of H and - H . A lower bound on the cosine of the maximum angle between any arbitrary nonzero vector v R n and the set of directions in D is defined as κ ( D ) = min 0 6 = v R n max d D v T d k v kk d k . With OrthoMads the measure κ ( D ) = 1 n is maximized over all positive bases. Audet and Vicente (SIOPT 2008) Optimization under general constraints 78/109
Background image of page 1

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

View Full DocumentRight Arrow Icon
Convergence analysis - OrthoMads with extreme barrier Theorem As k → ∞ , the set of OrthoMads normalized poll directions is dense in the unit sphere. Audet and Vicente (SIOPT 2008) Optimization under general constraints 79/109
Background image of page 2
Convergence analysis - OrthoMads with extreme barrier Theorem As k → ∞ , the set of OrthoMads normalized poll directions is dense in the unit sphere. Theorem Let ˆ x be the the limit of a subsequence of mesh local optimizers on
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: meshes that get innitely ne. If f is Lipschitz near x , then f ( x,v ) for all v T H ( x ) . Assuming more smoothness, Abramson studies second order convergence. Audet and Vicente (SIOPT 2008) Optimization under general constraints 79/109 Open, closed and hidden constraints Consider the toy problem: min x R 2 x 2 1- x 2 s.t.-x 2 1 + x 2 2 1 x 2 Audet and Vicente (SIOPT 2008) Optimization under general constraints 80/109 Open, closed and hidden constraints Consider the toy problem: min x R 2 x 2 1- x 2 s.t.-x 2 1 + x 2 2 1 x 2 Closed constraints must be satised at every trial vector of decision variables in order for the functions to evaluate. Here x 2 is a closed constraint, because if it is violated, the objective function will fail. Audet and Vicente (SIOPT 2008) Optimization under general constraints 80/109...
View Full Document

Page1 / 5

Finance Notes_Part_31 - meshes that get innitely ne. If f...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online