본문 바로가기

Math/Optimization

Oracle Complexity

Nesterov의  lectures on convex optimization 1.1.3 (Complexity Bounds for Global Optimziation) 관련해서 읽기 좋은 자료 :

https://class.ece.uw.edu/546/2016spr/lectures/introduction.pdf

 

'Math > Optimization' 카테고리의 다른 글

Knapsack problem  (0) 2025.04.05
Hermite Form  (0) 2025.04.05
Smoothness  (0) 2021.10.21
Proximal Gradient and Mirror Descent  (0) 2021.10.20
Duality  (0) 2021.10.17