1
Q
Definition
Descent direction.
Optimal step.
A
2
Q
Definition (Sufficient decrease condition/Arimijo condition)
A
3
Q
Definition 6.2
Convergence
A
4
Q
Definition
Pseudoinverse and condition number
A
5
Q
Theorem 6.4
Bound on error in (k+1)-th iterate.
A
MA265 MMM3
flashcards
Decks in class (19)
# Cards
-
1. Intro to Optimisation4
-
2. Prerequisites8
-
3. Convexity I7
-
4. Convexity II3
-
6. Iterative Algorithms II5
-
7. Newton's Method5
-
8. Linear Programming I: Polyhedra5
-
9. Linear Programming II: Duality7
-
10. Lagrange Duality6
-
11. KKT Optimality Conditions4
-
13. Introduction to Approximation Theory2
-
14. Polynomial Approximation in the max-norm I4
-
15. Polynomial Approximation in the max-norm II5
-
16. Polynomial Approximation in the 2-norm I2
-
17. Polynomial Approximation in the 2-norm II3
-
18. Approximation by Rational Functions1
-
19. Trigonometric Approximation and Fourier Series7
-
20. Fourier Series II4
-
23. Best-fit Subspaces and SVD II6
