MediumGradient & optimization

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

Invent an algorithm to converge to the Steiner point based on Problem…

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

Invent an algorithm to converge to the Steiner point based on Problem 35. Test it on the triangles of Problem 33.

This exercise builds on another exercise in its source book, which isn't shown here.

~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, #36

Stuck? A gentle nudge

No hints for this one.

Something off?

Workspace

Your working

Check your full solution

Attach photos of your pages (up to 3) or one PDF — or check what you typed above. Lemma reads the work and verifies the reasoning, not just the answer.

Your first check today doesn't need an account.

Your photos and PDFs are read once and not stored — only the transcription is kept.