Corpus ID: 232320645

Optimization Methods for Fully Composite Problems

@inproceedings{Doikov2021OptimizationMF,
  title={Optimization Methods for Fully Composite Problems},
  author={Nikita Doikov and Y. Nesterov},
  year={2021}
}
In this paper, we propose a new Fully Composite Formulation of convex optimization problems. It includes, as a particular case, the problems with functional constraints, max-type minimization problems, and problems of Composite Minimization, where the objective can have simple nondifferentiable components. We treat all these formulations in a unified way, highlighting the existence of very natural optimization schemes of different order. We prove the global convergence rates for our methods… Expand

References

SHOWING 1-10 OF 29 REFERENCES
Gradient methods for minimizing composite functions
  • Y. Nesterov
  • Mathematics, Computer Science
  • Math. Program.
  • 2013
  • 906
  • PDF
Contracting Proximal Methods for Smooth Convex Optimization
  • 12
  • PDF
Complexity bounds for primal-dual methods minimizing the model of objective function
  • Y. Nesterov
  • Mathematics, Computer Science
  • Math. Program.
  • 2018
  • 60
  • PDF
Cubic regularization of Newton method and its global performance
  • 607
  • PDF
Oracle complexity of second-order methods for smooth convex optimization
  • 42
  • PDF
Implementable tensor methods in unconstrained convex optimization
  • Y. Nesterov
  • Mathematics, Computer Science
  • Math. Program.
  • 2021
  • 58
  • PDF
Affine-invariant contracting-point methods for Convex Optimization
  • 1
  • PDF
Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method
  • 15
  • PDF
...
1
2
3
...