Warm-up
- Name, area, and a favorite textbook (take notes!)
- If you are elsewhere, we’ll find someone for you to do this with!
Logistics
- Waitlist notes
- Time zone issues
- Julia and other languages
- Readings
Optimization background
- Variational notation
- Reminder that Lagrange multipliers exist!
- Direct solves, fixed point iterations
- Models of functions and models of solver dynamics
Least squares
- Normal equations and calculus
- Alternate inner products
- Cholesky, QR, and SVD
- Aside re min norm connection
Activity (submit a notebook or PDF for points)
- Show that if ϕ:V→R is a
quadratic form, then a(v,w)=(ϕ(v+w)−ϕ(v)−ϕ(w))/2 is a
bilinear form for which ϕ(v)=a(v,v).
- Show that adding rows to a matrix (e.g. more data in a least squares
problem) can only increase the smallest singular value.
- Write a code to minimize
∑Nj=0|p(xj)−cos(xj)|2
where xj are points in a uniform mesh on [−π,π],
with p(x)=c0+c1x2+c2x4+c3x6.
- Argue that the coefficients converge to the coefficients that minimize
∫π−π|p(x)−cos(x)|2dx?
- Design (and answer) your own question that would be appropriate for
this type of exercise!