Optimization Online


Quasi-Newton methods on Grassmannians and multilinear approximations of tensors

Berkant Savas (berkant***at***cs.utexas.edu)
Lek-Heng Lim (lekheng***at***math.berkeley.edu)

Abstract: In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defined BFGS and L-BFGS updates in local and global coordinates on Grassmannians or a product of these. We proved that, when local coordinates are used, our BFGS updates on Grassmannians share the same optimality property as the usual BFGS updates on Euclidean spaces. When applied to the best multilinear rank approximation problem for general and symmetric tensors, our approach yields fast, robust, and accurate algorithms that exploit the special Grassmannian structure of the respective problems, and which work on tensors of large dimensions and arbitrarily high order. Extensive numerical experiments are included to substantiate our claims.

Keywords: Grassmann manifold, Grassmannian, product of Grassmannians, Grassmann quasi-Newton, Grassmann BFGS, Grassmann L-BFGS, multilinear rank, symmetric multilinear rank, tensor, symmetric tensor, approximations

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization (Other )

Category 3: Applications -- Science and Engineering (Data-Mining )

Citation: UT Austin/UC Berkeley preprint

Download: [PDF]

Entry Submitted: 08/03/2009
Entry Accepted: 08/03/2009
Entry Last Modified: 05/30/2010

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society