Newton ’ s method on Graßmann manifolds

نویسنده

  • Jochen Trumpf
چکیده

A general class of Newton algorithms on Graßmann and Lagrange–Graßmann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local ⋆ corresponding author The first author was partially supported by a grant from BMBF within the FprofUnd programme. The second and third author are with National ICT Australia Limited which is funded by the Australian Government’s Department of Communications, Information Technology and the Arts and the Australian Research Council through Backing Australia’s Ability and the ICT Research Centre of Excellence Program. U. Helmke Mathematisches Institut Universität Würzburg Am Hubland 97074 Würzburg Germany E-mail: [email protected] K. Hüper National ICT Australia Limited Canberra Research Laboratory Locked Bag 8001 Canberra ACT 2601 Australia E-mail: [email protected] and Department of Information Engineering The Australian National University J. Trumpf Department of Information Engineering The Australian National University Canberra ACT 0200 Australia Tel.: +61-2-61258677 Fax: +61-2-61258660 E-mail: [email protected] and National ICT Australia Limited Canberra Research Laboratory

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sphere packing bounds in the Graßmann and Stiefel manifolds

With methods from Riemannian geometry bounds for the minimal distance of packings in the Graßmann and Stiefel manifolds will be derived and analysed, revealing implications for certain aspects of coding theory. Though motivated from coding theory on the Graßmann and Stiefel manifolds, the method can be generalised to arbitrary Riemannian homogeneous spaces as well.

متن کامل

Riemannian Newton and conjugate gradient algorithm for computing Lagrangian invariant subspaces ∗

The computation of Lagrangian invariant subspaces of a Hamiltonian matrix, or the closely related task of solving algebraic Riccati equations, is an important issue in linear optimal control, stochastic control and H∞-design. We propose a new class of Riemannian Newton methods that allows to compute isolated Lagrangian invariant subspaces of a Hamiltonian matrix. The algorithm implements a vari...

متن کامل

A framework for generalising the Newton method and other iterative methods from Euclidean space to manifolds

The Newton iteration is a popular method for minimising a cost function on Euclidean space. Various generalisations to cost functions defined on manifolds appear in the literature. In each case, the convergence rate of the generalised Newton iteration needed establishing from first principles. The present paper presents a framework for generalising iterative methods from Euclidean space to mani...

متن کامل

A Newton-Grassmann Method for Computing the Best Multilinear Rank-(r1, r2, r3) Approximation of a Tensor

We derive a Newton method for computing the best rank-(r1, r2, r3) approximation of a given J × K × L tensor A. The problem is formulated as an approximation problem on a product of Grassmann manifolds. Incorporating the manifold structure into Newton’s method ensures that all iterates generated by the algorithm are points on the Grassmann manifolds. We also introduce a consistent notation for ...

متن کامل

Combinatorial Optimization with Information Geometry: The Newton Method

We discuss the use of the Newton method in the computation of max(p 7→ Ep [f ]), where p belongs to a statistical exponential family on a finite state space. In a number of papers, the authors have applied first order search methods based on information geometry. Second order methods have been widely used in optimization on manifolds, e.g., matrix manifolds, but appear to be new in statistical ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008