Cone-constrained eigenvalue problems: theory and algorithms

Authors:
A. Pinto Da Costa;A. Seeger
Affiliations:
Departamento de Engenharia Civil e Arquitectura and ICIST, Instituto Superior Técnico, Lisboa, Portugal 1049-001;Department of Mathematics, University of Avignon, Avignon, France 84000
Venue:
Computational Optimization and Applications
Year:
2010

Citing 4
Cited 6

Matrix analysis

Matrix analysis
On multiple eigenvalues of matrices depending on several parameters

SIAM Journal on Numerical Analysis
The eigenvalue complementarity problem

Computational Optimization and Applications
On the asymmetric eigenvalue complementarity problem

Optimization Methods & Software - GLOBAL OPTIMIZATION

Frictional instabilities in orthotropic hollow cylinders

Computers and Structures
A Variational Approach to Copositive Matrices

SIAM Review
A nonsmooth algorithm for cone-constrained eigenvalue problems

Computational Optimization and Applications
Reconstructing a matrix from a partial sampling of Pareto eigenvalues

Computational Optimization and Applications
Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization

Journal of Global Optimization
A new method for solving Pareto eigenvalue complementarity problems

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Equilibria in mechanics or in transportation models are not always expressed through a system of equations, but sometimes they are characterized by means of complementarity conditions involving a convex cone. This work deals with the analysis of cone-constrained eigenvalue problems. We discuss some theoretical issues like, for instance, the estimation of the maximal number of eigenvalues in a cone-constrained problem. Special attention is paid to the Paretian case. As a short addition to the theoretical part, we introduce and study two algorithms for solving numerically such type of eigenvalue problems.