Codes

The Matlab/Octave codes below come from examples I did in lecture, or they are from the Homework solutions. For the full Homework solutions go to the Canvas course page.

• sr1quadratic.m
• secant1d.m
• rosencompare.m
• sr1bt.m
• rosenbrock.m
• sdquad.m
• exer3p3.m
• testnewtsafe.m
• newtsafe.m (calls bt.m)
• newtsec.m
• POPDIP is my fairly-polished-by-now class project. It lives it its own Github repository. It implements a primal-dual interior point method, from section 16.7 of our textbook (Griva, Nash, & Sofer 2009). To try the Matlab/Octave code you should either clone the popdip repository or download a .zip release. Either way you will get the codes, documentation, and slides.
• These four codes go with my slides on why steepest descent needs help:
  1. sdbtrecord.m
  2. sdbt.m
  3. easyq.m
  4. bt.m
• salmon.m
• phaseone.m
• The simplex method bundle simplex.zip also includes Python3 versions written by Kaelin Ellis; see the py-simplex/ subdirectory when you extract.
• Simplex method bundle (all 7 .m codes are in simplex.zip):
  1. sfsimplex.m
  2. ezsimplex.m
  3. myexSF.m
  4. myexEZ.m
  5. bookexSF.m
  6. bookexEZ.m
  7. kleeminty.m
• nullmat.m
• ratiotest.m
• calc_brute.m
• calc_bisection.m
• calc_golden.m
• calc_newton.m
• fit.m