Fetching the paper…
Reading the bibliography…
Computing the Newton step for a generic function $f: \mathbb{R}^N \rightarrow \mathbb{R}$ takes $O(N^{3})$ flops.
D. H. Jacobson and D. Q. Mayne, Differential Dynamic Programming . North-Holland, 1970
1970
Earlier work this paper cites.
T. F. Coleman and J. J. More, “Estimation of sparse Hessian matrices and graph coloring problems,” Mathematical Programming , vol. 28, no. 3, pp. 243–270, 1984
1984
Earlier work this paper cites.
P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, “Some theoretical properties of an augmented lagrangian merit function.” DTIC Document, Tech. Rep., 1986
1986
Earlier work this paper cites.
J. De O. Pantoja, “Differential Dynamic Programming and Newton’s method,” International Journal of Control , vol. 47, no. 5, pp. 1539–1553, 1988
1988
Earlier work this paper cites.
S. J. Wright, “Solution of discrete-time optimal control problems on parallel computers,” Parallel Computing , vol. 16, no. 2, pp. 221–237, 1990
1990
Earlier work this paper cites.
S. J. Wright, “Interior point methods for optimal control of discrete time systems,” Journal of Optimization Theory and Applications , vol. 77, no. 1, pp. 161–187, 1993
1993
Earlier work this paper cites.
J. Utke, “Efficient Newton steps without Jacobians,” in Computational Differentiation: Techniques, Applications, and Tools , M. Berz, C. H. Bischof, G. F. Corliss, and A. Griewank, Eds. Philadelphia, PA: SIAM, 1996, pp. 253–264
1996
Earlier work this paper cites.
D. Ralph, “A parallel method for unconstrained discrete-time optimal control problems,” SIAM Journal on Optimization , vol. 6, no. 2, pp. 488–512, 1996
1996
Cited alongside, same era.
J. S. Yedidia, W. T. Freeman, and Y. Weiss, “Generalized Belief Propagation,” in NIPS , vol. 13, 2000, pp. 689–695
2000
Cited alongside, same era.
I. S. Duff, “MA57—a code for the solution of sparse symmetric definite and indefinite systems,” ACM Transactions on Mathematical Software (TOMS) , vol. 30, no. 2, pp. 118–144, 2004
2004
Cited alongside, same era.
E. Todorov and W. Li, “A generalized iterative LQG method for locally-optimal feedback control of constrained nonlinear stochastic systems,” in American Control Conference, 2005. Proceedings of the 2005 . IEEE, 2005, pp. 300–306
2005
Cited alongside, same era.
J. Nocedal and S. Wright, Numerical Optimization . Springer Science & Business Media, 2006
R. Bridson, “An ordering method for the direct solution of saddle-point matrices,” Preprint , 2007
2007
Later among the works it cites.
A. Griewank and A. Walther, Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation . SIAM, 2008
2008
Later among the works it cites.
M. J. Wainwright and M. I. Jordan, “Graphical Models, Exponential Families, and Variational Inference,” Foundations and Trends® in Machine Learning , vol. 1, no. 1-2, pp. 1–305, 2008
2008
Later among the works it cites.
L. Dixon, “Automatic Differentiation: Calculation of Newton Steps,” in Encyclopedia of Optimization . Springer, 2009, pp. 137–142
2009
Later among the works it cites.
M. Toussaint and C. Goerick, “A Bayesian view on motor control and planning,” in From Motor Learning to Interaction Learning in Robots . Springer, 2010, pp. 227–252
2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2006
Cited alongside, same era.
T. A. Davis, Direct Methods for Sparse Linear Systems . SIAM, 2006, vol. 2
2006
Cited alongside, same era.
J. Kleinberg and É. Tardos, Algorithm Design . Pearson, Addison-Wesley, 2006
2006
Cited alongside, same era.
Later among the works it cites.
Y. Tassa, T. Erez, and E. Todorov, “Optimal limit-cycle control recast as Bayesian inference,” in Proceedings of thh IFAC world congress . Citeseer, 2011
2011
Later among the works it cites.