# Escaping Saddle Points

1. Basic Defintions 1.1. Convex Set Let be a bounded convex and compact set of Euclidean space. We denote by D an upper bound on the diameter of . A set is convex if, 1.2. Convex Function A function is convex if, Equivalently, if is differentiable, that is, its gradient exists , then it is… Continue reading Escaping Saddle Points