Trust_Region_Methods.pdf
jubayer-ibn-hamid.github.io · 3,450 words · saved by 1 readers
N/A
Trust Region Methods Jubayer Ibn Hamid 1 Introduction These are notes on trust region optimization methods that I took as I read [1]. Intuitively, line search methods first make a quadratic model of the function f to generate a step direction and calculate the step length (preferably one that satisfies the Wolfe Conditions). In contrast, trust region methods also generate a model of the function f - but they define a region around where we are currently such that inside that region we believe our model is more or less the same as function f and then…
saved by
related reading
- rltheorybook_ABJKS.pdfrltheorybook.github.io
- RL_Notes__final_.pdfjubayer-ibn-hamid.github.io
- RLAlgsInMDPs.pdfsites.ualberta.ca
- Why Momentum Really Worksdistill.pub
- [2605.01172] A Theory of Generalization in Deep Learningarxiv.org
- [1605.08101] Global rates of convergence for nonconvex optimization on manifoldsarxiv.org
- prox_algs.pdfweb.stanford.edu
- Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimizationarxiv.org
- notes.pdfjingbol.web.illinois.edu
- Hamilton-Jacobi Equationsmath.mcgill.ca
- [2605.15522] Stochastic Non-Smooth Convex Optimization with Unbounded Gradientsarxiv.org
- Introduction to Inverse Problemsstat.uchicago.edu