Convex Optimization V: Newton's MethodTextbook
The classical convergence theory of smooth convex minimization. For a function that is -strongly convex and -smooth (), gradient descent converges linearly, while Newton's method exhibits its famous two phases: a damped phase in which every backtracking step decreases the objective by a fixed amount , and a quadrati…