Nonnegative inverse eigenvalue problems with partial eigendata
From MaRDI portal
Publication:664539
DOI10.1007/s00211-011-0415-yzbMath1238.65029OpenAlexW2132492255MaRDI QIDQ664539
Zhi Zhao, Zheng-Jian Bai, Stefano Serra Capizzano
Publication date: 2 March 2012
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-011-0415-y
numerical examplesnonnegative matrixNewton methodinverse eigenvalue problemglobal and quadratic convergencemonotone complementary problemnonnegative programming
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical solutions to inverse eigenvalue problems (65F18)
Related Items
Linearly structured quadratic model updating using partial incomplete eigendata, A Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isospectral flow method for nonnegative inverse eigenvalue problem with prescribed structure
- Inverse problems in vibrations.
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Backward perturbation analysis of certain characteristic subspaces
- Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A semismooth equation approach to the solution of nonlinear complementarity problems
- Sensitivity analysis of generalized equations
- Gradient flow methods for matrix completion with prescribed eigenvalues.
- The nonnegative inverse eigenvalue problem.
- On the resolution of monotone complementarity problems
- Finite element model updating in structural dynamics
- A nonsmooth version of Newton's method
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- Structured inverse eigenvalue problems
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Optimization and nonsmooth analysis
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Strongly Regular Generalized Equations
- Constructing Symmetric Nonnegative Matrices with Prescribed Eigenvalues by Differential Equations
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Semismooth and Semiconvex Functions in Constrained Optimization
- A Numerical Method for the Inverse Stochastic Spectrum Problem
- Numerical Optimization
- A special newton-type optimization method
- Smooth Approximations to Nonlinear Complementarity Problems
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Numerical Methods for Solving Inverse Eigenvalue Problems for Nonnegative Matrices
- Convex Analysis
- On the basic theorem of complementarity
- Semismooth Matrix-Valued Functions
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
