Power iteration and inverse power iteration for eigenvalue complementarity problem.

DOI10.1002/NLA.2244MaRDI QIDQ5227190zbMATH OpenOpenAlexFDO

Authors Fatemeh Abdi, Fatemeh Shakeri

Publication date 5 August 2019

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.2244

zbMATH Keywords

sequential quadratic programmingeigenvalue complementarity problemconditional gradient methodpower iteration methodinverse power iteration method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
• On the solution of the inverse eigenvalue complementarity problem
• The symmetric eigenvalue complementarity problem
• The eigenvalue complementarity problem
• The descent algorithm for solving the symmetric eigenvalue complementarity problem

Describes a project that uses

Uses Software

• PATH Solver
• Matlab

This page was built for publication: Power iteration and inverse power iteration for eigenvalue complementarity problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227190)