← Lab · Chapter 6: Convex and concave optimization problems

Descent to a local optimum

Where does a local method stop? In convex problems every local minimum is global. Pick a starting point and let the method descend: compare convex and non-convex functions.