Splitting methods for the eigenvalue complementarity problem
From MaRDI portal
Recommendations
- The symmetric eigenvalue complementarity problem
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- The eigenvalue complementarity problem
- Splitting methods for a class of horizontal linear complementarity problems
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
- A nonsmooth algorithm for cone-constrained eigenvalue problems
- Cone-constrained eigenvalue problems: Theory and algorithms
- Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems
- Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On an enumerative algorithm for solving eigenvalue complementarity problems
- On eigenvalues induced by a cone constraint.
- On the asymmetric eigenvalue complementarity problem
- On the computation of all eigenvalues for the eigenvalue complementarity problem
- On the convergence of the block principal pivotal algorithm for the LCP
- On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the numerical solution of the quadratic eigenvalue complementarity problem
- On the quadratic eigenvalue complementarity problem over a general convex cone
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- The directional instability problem in systems with frictional contacts.
- The eigenvalue complementarity problem
- The symmetric eigenvalue complementarity problem
- Variational inequality formulation of the asymmetric eigenvalue complementarity problem and its solution by means of gap functions
Cited in
(10)- A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- An active-set algorithmic framework for non-convex optimization problems over the simplex
- On the splitting iteration method for Pareto eigenvalue complementarity problems of H + -matrices
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- Solution of fractional quadratic programs on the simplex and application to the eigenvalue complementarity problem
- Solving inverse Pareto eigenvalue problems
- Interior point methods for solving Pareto eigenvalue complementarity problems
- A block Lanczos method for the symmetric generalized eigenvalue complementarity problem
- Perturbation Splitting for More Accurate Eigenvalues
This page was built for publication: Splitting methods for the eigenvalue complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5238067)
