Corpus ID: 221802753

Affine-invariant contracting-point methods for Convex Optimization

  title={Affine-invariant contracting-point methods for Convex Optimization},
  author={Nikita Doikov and Y. Nesterov},
  journal={arXiv: Optimization and Control},
In this paper, we develop new affine-invariant algorithms for solving composite con- vex minimization problems with bounded domain. We present a general framework of Contracting-Point methods, which solve at each iteration an auxiliary subproblem re- stricting the smooth part of the objective function onto contraction of the initial domain. This framework provides us with a systematic way for developing optimization methods of different order, endowed with the global complexity bounds. We show… Expand
1 Citations

Figures from this paper


Implementable tensor methods in unconstrained convex optimization
  • Y. Nesterov
  • Mathematics, Computer Science
  • Math. Program.
  • 2021
Inexact accelerated high-order proximal-point methods
Optimal Combination of Tensor Optimization Methods
Gradient methods for minimizing composite functions
  • Y. Nesterov
  • Mathematics, Computer Science
  • Math. Program.
  • 2013
Inexact Tensor Methods with Dynamic Accuracies
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
Superfast second-order methods for unconstrained convex optimization
Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization
Complexity bounds for primal-dual methods minimizing the model of objective function
  • Y. Nesterov
  • Mathematics, Computer Science
  • Math. Program.
  • 2018
Interior-point polynomial algorithms in convex programming