MediumGradient & optimization

Gilbert Strang, Calculus, 3rd edition (Wellesley-Cambridge Press; MIT OpenCourseWare RES.18-001) §13.6 Maxima, Minima, and Saddle Points, #39 · Multivariable Calculus · Gradient & optimization

Follow the minimizing point with your code as … increases:

These problems minimize the Steiner distance $f = d_{1} + d_{2} + d_{3}$ and related functions. A computer is needed for 33 and.

Follow the minimizing point with your code as $p$ increases: $p = 2, p = 4, p = 8, p = 16$ . Guess the limit at $p = \infty$ and test whether it is equally distant from the three corners.

~8 minWritten answer · check your work with Lemma

Gilbert Strang, Calculus, 3rd edition (Wellesley-Cambridge Press; MIT OpenCourseWare RES.18-001) · §13.6 Maxima, Minima, and Saddle Points, #39

Stuck? A gentle nudge

No hints for this one.

Something off?

Workspace

Your working

Check your full solution

Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.