Fetching the paper…
Reading the bibliography…
In this paper, we propose a new Fully Composite Formulation of convex optimization problems.
An algorithm for quadratic programming
Marguerite Frank and Philip Wolfe · 1956
Earlier work this paper cites.
A method for solving the convex programming problem with convergence rate O(1/kˆ2)
Yurii Nesterov · 1983
Earlier work this paper cites.
Effective methods in nonlinear programming
Yurii Nesterov · 1989
Earlier work this paper cites.
New proximal point algorithms for convex minimization
Osman Güler · 1992
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming
Yurii Nesterov and Arkadii Nemirovskii · 1994
Earlier work this paper cites.
Cubic regularization of Newton’s method and its global performance
Yurii Nesterov and Boris Polyak · 2006
Earlier work this paper cites.
Accelerating the cubic regularization of Newton’s method on convex problems
Yurii Nesterov · 2008
Earlier work this paper cites.
An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
Renato DC Monteiro and Benar F Svaiter · 2013
Earlier work this paper cites.
Gradient methods for minimizing composite functions
Yurii Nesterov · 2013
Earlier work this paper cites.
A universal catalyst for first-order optimization
Hongzhou Lin, Julien Mairal, and Zaid Harchaoui · 2015
Earlier work this paper cites.
Regularized Newton methods for minimizing functions with Hölder continuous Hessians
Geovani Grapiglia and Yurii Nesterov · 2017
Cited alongside, same era.
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
Coralia Cartis and Katya Scheinberg · 2018
Cited alongside, same era.
Complexity bounds for primal-dual methods minimizing the model of objective function
Yurii Nesterov · 2018
Cited alongside, same era.
Lectures on convex optimization
Yurii Nesterov · 2018
Cited alongside, same era.
Oracle complexity of second-order methods for smooth convex optimization
Yossi Arjevani, Ohad Shamir, and Ron Shiff · 2019
Cited alongside, same era.
Near-optimal method for highly smooth convex optimization
Sébastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, and Aaron Sidford · 2019
Affine-invariant contracting-point methods for convex optimization
Nikita Doikov and Yurii Nesterov · 2020
Later among the works it cites.
Contracting proximal methods for smooth convex optimization
Nikita Doikov and Yurii Nesterov · 2020
Later among the works it cites.
Convex optimization based on global lower second-order models
Nikita Doikov and Yurii Nesterov · 2020
Later among the works it cites.
Inexact tensor methods with dynamic accuracies
Nikita Doikov and Yurii Nesterov · 2020
Later among the works it cites.
Tensor methods for minimizing convex functions with Hölder continuous higher-order derivatives
Geovani Grapiglia and Yurii Nesterov · 2020
Later among the works it cites.
Stochastic subspace cubic Newton method
Filip Hanzely, Nikita Doikov, Peter Richtárik, and Yurii Nesterov · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Optimal tensor methods in smooth convex and uniformly convexoptimization
Alexander Gasnikov, Pavel Dvurechensky, Eduard Gorbunov, Evgeniya Vorontsova, Daniil Selikhanovych, and César A Uribe · 2019
Cited alongside, same era.
An optimal high-order tensor method for convex optimization
Bo Jiang, Haoyue Wang, and Shuzhong Zhang · 2019
Cited alongside, same era.
Implementable tensor methods in unconstrained convex optimization
Yurii Nesterov · 2019
Cited alongside, same era.
Smoothness parameter of power of Euclidean norm
Anton Rodomanov and Yurii Nesterov · 2020
Later among the works it cites.
Acceleration methods
Alexandre d’Aspremont, Damien Scieur, and Adrien Taylor · 2021
Closest in time.
Minimizing uniformly convex functions by cubic regularization of newton method
Nikita Doikov and Yurii Nesterov · 2021
Closest in time.