5,321
edits
Numerical Optimization: Difference between revisions
→Trust Region Methods
| Line 16: | Line 16: | ||
** Find a region where you trust your model accurately represents your objective function. | ** Find a region where you trust your model accurately represents your objective function. | ||
** Take a step. | ** Take a step. | ||
<br> | |||
Variables: | |||
* <math>f</math> is your objective function. | |||
* <math>m_k</math> is your quadratic model at iteration k. | |||
* <math>x_k</math> is your point at iteration k. | |||
Your model is <math>m_k(p) = f_k + g_k^T p + \frac{1}{2}p^T B_k p</math> | |||
where <math>g_k = \nabla f(x_k)</math> and <math>B_k</math> is a symmetric matrix.<br> | |||
At each iteration, you solve a constrained optimization subproblem to find the best step <math>p</math>.<br> | |||
<math>\min_{p \in \mathbb{R}^n} m_k(p)</math> such that <math>\Vert p \Vert < \Delta_k </math>. | |||
==Resources== | ==Resources== | ||
* [https://link.springer.com/book/10.1007%2F978-0-387-40065-5 Numerical Optimization by Nocedal and Wright (2006)<br> | * [https://link.springer.com/book/10.1007%2F978-0-387-40065-5 Numerical Optimization by Nocedal and Wright (2006)<br> | ||