Parameterized eigensolution technique for solving constrained least squares problems∗
From MaRDI portal
Publication:4521953
Recommendations
Cites work
- An implicit shift bidiagonalization algorithm for ill-posed systems
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Computing a Trust Region Step
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 883145 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Implicit Nullspace Iterative Methods for Constrained Least Squares Problems
- Least squares with a quadratic constraint
- Newton’s Method with a Model Trust Region Modification
- On the Method of Weighting for Equality-Constrained Least-Squares Problems
- On the regularization of projection methods for solving ill-posed problems
- Quadratically constrained least squares and quadratic problems
- Safeguarded use of the implicit restarted lanczos technique for solving non‐linear structural eigensystems
Cited in
(7)- Solving large-scale constrained least-squares problems.
- Partial eigenstructure assignment problem and its application to the constrained linear problem
- The parametric least squares technique for λ-non-linear eigenvalue problems
- scientific article; zbMATH DE number 1367595 (Why is no real title available?)
- scientific article; zbMATH DE number 1424424 (Why is no real title available?)
- The parametric least squares technique for double eigenvalue problems
- Least squares problems with inequality constraints as quadratic constraints
This page was built for publication: Parameterized eigensolution technique for solving constrained least squares problems∗
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4521953)