On the quadratic eigenvalue complementarity problem
From MaRDI portal
(Redirected from Publication:330258)
global optimizationnonlinear programmingnumerical experimentsquadratic eigenvalue complementarity problem
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Recommendations
- On the symmetric quadratic eigenvalue complementarity problem
- On the numerical solution of the quadratic eigenvalue complementarity problem
- On the quadratic eigenvalue complementarity problem over a general convex cone
- The second-order cone quadratic eigenvalue complementarity problem
- Solving the quadratic eigenvalue complementarity problem by DC programming
Cites work
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- A nonsmooth algorithm for cone-constrained eigenvalue problems
- Cone-constrained eigenvalue problems: Theory and algorithms
- Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- On an enumerative algorithm for solving eigenvalue complementarity problems
- On cardinality of Pareto spectra
- 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 solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- On the symmetric quadratic eigenvalue complementarity problem
- Quadratic Eigenvalue Problems under Conic Constraints
- The directional instability problem in systems with frictional contacts.
- The eigenvalue complementarity problem
- The gap function of a convex program
- The symmetric eigenvalue complementarity problem
- Variational inequality formulation of the asymmetric eigenvalue complementarity problem and its solution by means of gap functions
Cited in
(15)- On the quadratic eigenvalue complementarity problem over a general convex cone
- Complementarity eigenvalue problems for nonlinear matrix pencils
- Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
- A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem
- New results on Pareto spectra
- On the computation of all eigenvalues for the eigenvalue complementarity problem
- On the numerical solution of the quadratic eigenvalue complementarity problem
- On the symmetric quadratic eigenvalue complementarity problem
- On the asymmetric eigenvalue complementarity problem
- An alternating direction method of multipliers for the eigenvalue complementarity problem
- The second-order cone quadratic eigenvalue complementarity problem
- Cone-constrained rational eigenvalue problems
- Solving the quadratic eigenvalue complementarity problem by DC programming
- Title not available (Why is no real title available?)
- On the quality of complementary bounds for eigenvalues
This page was built for publication: On the quadratic eigenvalue complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q330258)
