Thr formulation and analysis of numerical methods for inverse Eigenvalue problems
SIAM Journal on Numerical Analysis
Newton's method for B-differentiable equations
Mathematics of Operations Research
Least-change secant update methods for undetermined systems
SIAM Journal on Numerical Analysis
Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations
Journal of Computational and Applied Mathematics
A nonsmooth version of Newton's method
Mathematical Programming: Series A and B
SIAM Journal on Optimization
Nonsmooth Equations in Optimization: Regularity, Calculus, Methods and Applications (Nonconvex Optimization and Its Applications)
The eigenvalue complementarity problem
Computational Optimization and Applications
On the asymmetric eigenvalue complementarity problem
Optimization Methods & Software - GLOBAL OPTIMIZATION
Cone-constrained eigenvalue problems: theory and algorithms
Computational Optimization and Applications
A nonsmooth algorithm for cone-constrained eigenvalue problems
Computational Optimization and Applications
| Hi-index | 0.00 |
Let 驴={驴 1,驴,驴 p } be a given set of distinct real numbers. This work deals with the problem of constructing a real matrix A of order n such that each element of 驴 is a Pareto eigenvalue of A, that is to say, for all k驴{1,驴,p} the complementarity system $$x\geq \mathbf{0}_n,\quad Ax-\lambda_k x\geq \mathbf{0}_n,\quad \langle x, Ax-\lambda_k x\rangle = 0$$ admits a nonzero solution x驴驴 n .