The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem.
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 53115 (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 family of NCP functions and a descent method for the nonlinear complementarity problem
- A new method for obtaining eigenvalues of variational inequalities: operators with multiple eigenvalues
- A new method for solving Pareto eigenvalue complementarity problems
- A nonsmooth algorithm for cone-constrained eigenvalue problems
- Cone-constrained eigenvalue problems: Theory and algorithms
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Local minima of quadratic forms on convex cones
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
- On cardinality of Pareto spectra
- On eigenvalues induced by a cone constraint.
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Some global bifurcation results for variational inequalities
- Stability of finite-dimensional nonlinear elastic systems with unilateral contact and friction
- The Perron generalized eigenspace and the spectral cone of a cone-preserving map
- The directional instability problem in systems with frictional contacts.
- The eigenvalue complementarity problem
- The semismooth and smoothing Newton methods for solving Pareto eigenvalue problem
- The symmetric eigenvalue complementarity problem
- Theory of cones
Cited in
(1)
This page was built for publication: The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175143)