Fetching the paper…
Reading the bibliography…
We propose faster methods for unconstrained optimization of \emph{structured convex quartics}, which are convex functions of the form \begin{equation*} f(x) = c^\top x + x^\top \mathbf{G} x + \mathbf{T}[x,x,x] + \frac{1}{24} \mathopen\| \mathbf{A} x \mathclose\|_4^4 \end{equation*} for $c \in \mathbb{R}^d$, $\mathbf{G} \in \mathbb{R}^{d \times d}$, $\mathbf{T} \in \mathbb{R}^{d \times d \times d}$, and $\mathbf{A} \in \mathbb{R}^{n \times d}$ such that $\mathbf{A}^\top \mathbf{A} \succ 0$.
Polynomial algorithms in linear programming
Leonid G. Khachiyan · 1980
Earlier work this paper cites.
Some np-complete problems in quadratic and nonlinear programming
Katta G Murty and Santosh N Kabadi · 1987
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming , volume 13
Yurii Nesterov and Arkadii Nemirovskii · 1994
Earlier work this paper cites.
Minimizing polynomial functions
Pablo A Parrilo and Bernd Sturmfels · 2003
Earlier work this paper cites.
Np-hardness of deciding convexity of quartic polynomials and related problems
Amir Ali Ahmadi, Alex Olshevsky, Pablo A Parrilo, and John N Tsitsiklis · 2013
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 Fux Svaiter · 2013
Cited alongside, same era.
Uniform sampling for matrix approximation
Michael B Cohen, Yin Tat Lee, Cameron Musco, Christopher Musco, Richard Peng, and Aaron Sidford · 2015
Cited alongside, same era.
A faster cutting plane method and its implications for combinatorial and convex optimization
Yin Tat Lee, Aaron Sidford, and Sam Chiu-wai Wong · 2015
Cited alongside, same era.
Amir Ali Ahmadi, Etienne de Klerk, and Georgina Hall · 2017
Cited alongside, same era.
Low-rank approximation and regression in input sparsity time
Kenneth L Clarkson and David P Woodruff · 2017
Cited alongside, same era.
Finding approximate local minima faster than gradient descent
Naman Agarwal, Zeyuan Allen-Zhu, Brian Bullins, Elad Hazan, and Tengyu Ma
Cited in the paper.
Second-order stochastic optimization for machine learning in linear time
Naman Agarwal, Brian Bullins, and Elad Hazan
Cited in the paper.
Leverage score sampling for faster accelerated regression and erm
Naman Agarwal, Sham Kakade, Rahul Kidambi, Yin Tat Lee, Praneeth Netrapalli, and Aaron Sidford
Cited in the paper.
An homotopy method for l p regression provably beyond self-concordance and in input-sparsity time
Sébastien Bubeck, Michael B Cohen, Yin Tat Lee, and Yuanzhi Li
Cited in the paper.
Near-optimal method for highly smooth convex optimization
Sébastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, and Aaron Sidford
Cited in the paper.
Implementable tensor methods in unconstrained convex optimization
Yurii Nesterov
Cited in the paper.
Lectures on Convex Optimization
Yurii Nesterov
Cited in the paper.
Lower bounds for higher-order convex optimization
Naman Agarwal and Elad Hazan · 2018
Closest in time.
Oracle complexity of second-order methods for smooth convex optimization
Yossi Arjevani, Ohad Shamir, and Ron Shiff · 2018
Closest in time.
The global rate of convergence for optimal tensor methods in smooth convex optimization
Alexander Gasnikov, Dmitry Kovalev, Ahmed Mohhamed, and Elena Chernousova · 2018
Closest in time.
An optimal high-order tensor method for convex optimization
Bo Jiang, Haoyue Wang, and Shuzhong Zhang · 2018
Closest in time.
Relatively smooth convex optimization by first-order methods, and applications
Haihao Lu, Robert M Freund, and Yurii Nesterov · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…