Fetching the paper…
Reading the bibliography…
We derive nonlinear acceleration methods based on the limited memory BFGS (L-BFGS) update formula for accelerating iterative optimization methods of alternating least squares (ALS) type applied to canonical polyadic (CP) and Tucker tensor decompositions.
Richardson LF. The approximate arithmetical solution by finite differences of physical problems including differential equations, with an application to the stresses in a masonry dam. Philosophical Transactions of the Royal Society A 1911; 210
1911
Earlier work this paper cites.
Moore EH. On the reciprocal of the general algebraic matrix. Bulletin of the American Mathematical Society 1920; 26
1920
Earlier work this paper cites.
Eckart C, Young G. The approximation of one matrix by another of lower rank. Psychometrika 1936; 1
1936
Earlier work this paper cites.
Sherman J, Morrison WJ. Adjustment of an inverse matrix corresponding to a change in one element of a given matrix. The Annals of Mathematical Statistics 1950; 21
1950
Earlier work this paper cites.
Woodbury MA. Inverting modified matrices. Memorandum report 1950; 42
1950
Earlier work this paper cites.
Bartlett MS. An inverse matrix adjustment arising in discriminant analysis. The Annals of Mathematical Statistics 1951; 22
1951
Earlier work this paper cites.
Hestenes MR, Stiefel E. Methods of conjugate gradients for solving linear systems , vol. 49. National Bureau of Standards Washington, DC, 1952
1952
Earlier work this paper cites.
Young D. Iterative methods for solving partial difference equations of elliptic type. Transactions of the American Mathematical Society 1954; 76
1954
Earlier work this paper cites.
Penrose R. A generalized inverse for matrices. Mathematical Proceedings of the Cambridge Philosophical Society 1955; 51
1955
Earlier work this paper cites.
Tucker LR. Implications of factor analysis of three-way matrices for measurement of change. Problems in measuring change 1963; :122–137
1963
Earlier work this paper cites.
Anderson DG. Iterative procedures for nonlinear integral equations. Journal of the ACM 1965; 12
1965
Earlier work this paper cites.
Tucker LR. Some mathematical notes on three-mode factor analysis. Psychometrika 1966; 31
1966
Earlier work this paper cites.
Polak E, Ribière G. Note sur la convergence de méthodes de directions conjuguées. ESAIM: Mathematical Modelling and Numerical Analysis-Modélisation Mathématique Et Analyse Numérique 1969; 3
1969
Earlier work this paper cites.
Carroll JD, Chang JJ. Analysis of individual differences in multidimensional scaling via an n-way generalization of “eckart-young” decomposition. Psychometrika 1970; 35
1970
Earlier work this paper cites.
Harshman RA. Foundations of the parafac procedure: Models and conditions for an” explanatory” multi-modal factor analysis 1970;
1970
Earlier work this paper cites.
Young D. Iterative solution of large linear systems . Computer science and applied mathematics, Academic Press, 1971
1971
Earlier work this paper cites.
Bartels R, Daniel JW. A conjugate gradient approach to nonlinear elliptic boundary value problems in irregular regions. Conference on the Numerical Solution of Differential Equations , Lecture Notes in Mathematics , vol. 363, Watson G (ed.). Springer Berlin Heidelberg, 1974; 1–11, 10.1007/BFb0069120 . URL http://dx.doi.org/10.1007/BFb0069120
1974
Earlier work this paper cites.
Concus P, Golub GH, O’Leary DP. Numerical solution of nonlinear elliptic partial differential equations by a generalized conjugate gradient method. Computing 1978; 19
1978
Earlier work this paper cites.
Buckley AG. Extending the relationship between the conjugate gradient and BFGS algorithms. Mathematical Programming 1978; 15
1978
Earlier work this paper cites.
Nazareth L. A relationship between the BFGS and conjugate gradient algorithms and its implications for new algorithms. SIAM Journal on Numerical Analysis 1979; 16
1979
Earlier work this paper cites.
Mittelmann HD. On the efficient solution of nonlinear finite element equations i. Numerische Mathematik 1980; 35
1980
Earlier work this paper cites.
Byrd RH, Nocedal J, Schnabel RB. Representations of quasi-newton matrices and their use in limited memory methods. Mathematical Programming 1994; 63
1994
Cited alongside, same era.
Moré JJ, Thuente DJ. Line search algorithms with guaranteed sufficient decrease. ACM Transactions on Mathematical Software (TOMS) 1994; 20
1994
Cited alongside, same era.
Dennis JE Jr, Schnabel RB. Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16) . Soc for Industrial & Applied Math, 1996
1996
Cited alongside, same era.
Lanzkron PJ, Rose DJ, Wilkes JT. An analysis of approximate nonlinear elimination. SIAM Journal on Scientific Computing 1996; 17
1996
Cited alongside, same era.
Bro R. Multi-way analysis in the food industry: models, algorithms, and applications. PhD Thesis, Københavns Universitet 1998
1998
Ishteva M, De Lathauwer L, Absil PA, Van Huffel S. Differential-geometric Newton method for the best rank- ( r 1 , r 2 , r 3 ) (r_{1},r_{2},r_{3}) approximation of tensors. Numerical Algorithms 2009; 51
2009
Later among the works it cites.
Fang Hr, Saad Y. Two classes of multisecant methods for nonlinear acceleration. Numerical Linear Algebra with Applications 2009; 16
2009
Later among the works it cites.
Absil PA, Mahony R, Sepulchre R. Optimization algorithms on matrix manifolds . Princeton University Press, 2009
2009
Later among the works it cites.
Savas B, Lim LH. Quasi-Newton methods on Grassmannians and multilinear approximations of tensors. SIAM Journal on Scientific Computing 2010; 32
2010
Later among the works it cites.
Dunlavy DM, Kolda TG, Acar E. Poblano v1.0: A matlab toolbox for gradient-based optimization. Technical Report SAND2010-1422 , Sandia National Laboratories, Albuquerque, NM and Livermore, CA Mar 2010
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Edelman A, Arias TA, Smith ST. The geometry of algorithms with orthogonality constraints. SIAM journal on Matrix Analysis and Applications 1998; 20
1998
Cited alongside, same era.
Kelley CT. Iterative methods for optimization 1999
1999
Cited alongside, same era.
De Lathauwer L, De Moor B, Vandewalle J. On the best rank-1 and rank- ( r 1 , r 2 , … , r n ) (r_{1},r_{2},\ldots,r_{n}) approximation of higher-order tensors. SIAM Journal on Matrix Analysis and Applications 2000; 21
2000
Cited alongside, same era.
De Lathauwer L, De Moor B, Vandewalle J. A multilinear singular value decomposition. SIAM journal on Matrix Analysis and Applications 2000; 21
2000
Cited alongside, same era.
Cai XC, Keyes DE. Nonlinearly preconditioned inexact newton algorithms. SIAM Journal on Scientific Computing 2002; 24
2002
Cited alongside, same era.
Hager WW, Zhang H. A new conjugate gradient method with guaranteed descent and an efficient line search. SIAM Journal on Optimization 2005; 16
2005
Cited alongside, same era.
Smilde A, Bro R, Geladi P. Multi-way analysis: applications in the chemical sciences . John Wiley & Sons, 2005
2005
Cited alongside, same era.
2010
Later among the works it cites.
Acar E, Dunlavy DM, Kolda TG. A scalable optimization approach for fitting canonical tensor decompositions. Journal of Chemometrics 2011; 25
2011
Later among the works it cites.
Ishteva M, Absil PA, Van Huffel S, De Lathauwer L. Best low multilinear rank approximation of higher-order tensors, based on the Riemannian trust-region scheme. SIAM Journal on Matrix Analysis and Applications 2011; 32
2011
Later among the works it cites.
De Sterck H. A nonlinear GMRES optimization algorithm for canonical tensor decomposition. SIAM Journal on Scientific Computing 2012; 34
2012
Later among the works it cites.
Bader BW, Kolda TG, et al. . Matlab tensor toolbox version 2.5. Available online January 2012. URL http://www.sandia.gov/~tgkolda/TensorToolbox/
2012
Later among the works it cites.
Vannieuwenhoven N, Vandebril R, Meerbergen K. A new truncation strategy for the higher-order singular value decomposition. SIAM Journal on Scientific Computing 2012; 34
2012
Later among the works it cites.
De Sterck H. Steepest descent preconditioning for nonlinear GMRES optimization. Numerical Linear Algebra with Applications 2013; 20
2013
Later among the works it cites.
Zhang M, Ding C. Robust Tucker tensor decomposition for effective image representation. Computer Vision (ICCV), 2013 IEEE International Conference on , 2013; 2448–2455
2013
Later among the works it cites.
Son NT. A real time procedure for affinely dependent parametric model order reduction using interpolation on Grassmann manifolds. International Journal for Numerical Methods in Engineering 2013; 93
2013
Later among the works it cites.
De Sterck H, Winlaw M. A nonlinearly preconditioned conjugate gradient algorithm for rank-r canonical tensor approximation. Numerical Linear Algebra with Applications 2014;
2014
Later among the works it cites.
Hwang FN, Su YC, Cai XC. A parallel adaptive nonlinear elimination preconditioned inexact Newton method for transonic full potential equation. Computers & Fluids 2015; 110
2014
Later among the works it cites.
Wright SJ. Coordinate descent algorithms. Mathematical Programming 2015; 151
2015
Later among the works it cites.
Luenberger DG, Ye Y. Linear and nonlinear programming , vol. 228. Springer, 2015
2015
Later among the works it cites.
Brune PR, Knepley MG, Smith BF, Tu X. Composing scalable nonlinear algebraic solvers. SIAM Review 2015; 57
2015
Later among the works it cites.
Cichocki A, Mandic D, De Lathauwer L, Zhou G, Zhao Q, Caiafa C, Phan AH. Tensor decompositions for signal processing applications: From two-way to multiway component analysis. Signal Processing Magazine, IEEE March 2015; 32
2015
Later among the works it cites.
De Sterck H, Howse AJM. Nonlinearly preconditioned optimization on Grassmann manifolds for computing approximate Tucker tensor decompositions. SIAM Journal on Scientific Computing 2016;
2016
Later among the works it cites.