# Affine-invariant contracting-point methods for Convex Optimization

@article{Doikov2020AffineinvariantCM, title={Affine-invariant contracting-point methods for Convex Optimization}, author={Nikita Doikov and Y. Nesterov}, journal={arXiv: Optimization and Control}, year={2020} }

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

#### One Citation

#### References

SHOWING 1-10 OF 27 REFERENCES

Implementable tensor methods in unconstrained convex optimization

- Mathematics, Computer Science
- Math. Program.
- 2021

Gradient methods for minimizing composite functions

- Mathematics, Computer Science
- Math. Program.
- 2013

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

- Computer Science, Mathematics
- Math. Oper. Res.
- 2017

Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization

- Mathematics, Computer Science
- ICML
- 2013

Complexity bounds for primal-dual methods minimizing the model of objective function

- Mathematics, Computer Science
- Math. Program.
- 2018

Interior-point polynomial algorithms in convex programming

- Mathematics, Computer Science
- Siam studies in applied mathematics
- 1994