A nonsmooth algorithm for cone-constrained eigenvalue problems

  • Authors:
  • Samir Adly;Alberto Seeger

  • Affiliations:
  • XLIM UMR CNRS 6172, Université de Limoges, Limoges, France 87060;Département de Mathématiques, Université d'Avignon, Avignon, France 84000

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study several variants of a nonsmooth Newton-type algorithm for solving an eigenvalue problem of the form $$K\ni x\perp(Ax-\lambda Bx)\in K^{+}.$$ Such an eigenvalue problem arises in mechanics and in other areas of applied mathematics. The symbol K refers to a closed convex cone in the Euclidean space 驴 n and (A,B) is a pair of possibly asymmetric matrices of order n. Special attention is paid to the case in which K is the nonnegative orthant of 驴 n . The more general case of a possibly unpointed polyhedral convex cone is also discussed in detail.