The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem.
DOI10.21136/am.2023.0020-22OpenAlexW4319080419MaRDI QIDQ6175143
Publication date: 17 August 2023
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21136/am.2023.0020-22
descent algorithmnonlinear complementarity functionPareto eigenvalue complementarity problemgeneralized eigenvalue complementarity problem
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10)
Cites Work
- Unnamed Item
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- A nonsmooth algorithm for cone-constrained eigenvalue problems
- The Perron generalized eigenspace and the spectral cone of a cone-preserving map
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- A family of NCP functions and a descent method for the nonlinear complementarity problem
- Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions
- Theory of cones
- On eigenvalues induced by a cone constraint.
- The directional instability problem in systems with frictional contacts.
- Stability of finite-dimensional nonlinear elastic systems with unilateral contact and friction
- A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem
- Some global bifurcation results for variational inequalities
- Cone-constrained eigenvalue problems: Theory and algorithms
- Local minima of quadratic forms on convex cones
- A new method for solving Pareto eigenvalue complementarity problems
- The semismooth and smoothing Newton methods for solving Pareto eigenvalue problem
- The eigenvalue complementarity problem
- On cardinality of Pareto spectra
- A new method for obtaining eigenvalues of variational inequalities: operators with multiple eigenvalues
- The symmetric eigenvalue complementarity problem
- ON SOME NCP-FUNCTIONS BASED ON THE GENERALIZED FISCHER–BURMEISTER FUNCTION
This page was built for publication: The descent algorithms for solving symmetric Pareto eigenvalue complementarity problem.