Evaluation Complexity Of Algorithms For Nonconvex Optimization: Theory, Computation, And Perspectives

The first book on complexity to cover topics such as composite and constrained optimization, derivative-free optimization, subproblem solution, and optimal (lower and sharpness) bounds for nonconvex problems, and to address the disadvantages of traditional optimality measures and propose useful surrogates.