We consider the convex-concave saddle point problem , where the decision variables and/or are subject to certain multi-block structure and affine coupling constraints, and possesses certain separa…
In this work, we study a generic class of decentralized algorithms in which agents jointly optimize the nonconvex objective function , while only communicating with their neighbors. This class of…
The cubic regularized Newton method of Nesterov and Polyak has become increasingly popular for nonconvex optimization because of its capability of finding an approximate local solution with a secon…
We consider multilevel composite optimization problems where each mapping in the composition is the expectation over a family of randomly chosen smooth mappings or the sum of some finite number of …