Abstract: The Nelder-Mead simplex method is a well-known algorithm enabling the minimization of functions that are not available in closed-form and that need not be differentiable or convex.

Lecturer: Jason Li (jmli@cs). TA: Meredith Pan (shiqip@andrew). Office hours: Meredith Thursdays 4-5pm, Gates 5th floor commons (subject to change); Jason Tuesdays 2-3pm, Gates 5011 Contacting us: ...

There was an error while loading. Please reload this page.