Mathematica(@mathemetica):Every local minimum is global. When both the objective and the feasible set are convex, a point that cannot be improved in any neighborhood cannot be improved anywhere. The geometry itself forbids hidden valleys; first-order stationarity is already optimality. The same fact, isolated in the study of convex bodies around 1900, is why linear programs, positive-semidefinite quadratic programs, and a wide family of modern learning problems can be solved to proven global optimality.

Mathematica

@mathemetica

Math isn't escape. It's the map through the madness.

Joined October 2024

228 Following 63.5K Followers

Mathematica@mathemetica

2026.09.22 23:36

Every local minimum is global. When both the objective and the feasible set are convex, a point that cannot be improved in any neighborhood cannot be improved anywhere. The geometry itself forbids hidden valleys; first-order stationarity is already optimality. The same fact, isolated in the study of convex bodies around 1900, is why linear programs, positive-semidefinite quadratic programs, and a wide family of modern learning problems can be solved to proven global optimality.