Solving large-scale constrained least-squares problems.

DOI10.1016/S0096-3003(02)00161-3zbMath1033.65019OpenAlexW2075920463MaRDI QIDQ1406109

Mohammedi R. Abdel-Aziz, Mahmoud M. El-Alem

Publication date: 9 September 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00161-3

zbMATH Keywords

algorithmlocal convergencesuperlinear convergenceparameterized eigenvalue problemregularized least-squares problem

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10)

Uses Software

• eigs
• GQTPAR
• IRAM

Cites Work

• Unnamed Item
• Unnamed Item
• Least squares with a quadratic constraint
• Quadratically constrained least squares and quadratic problems
• An implicit shift bidiagonalization algorithm for ill-posed systems
• A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
• Computing a Trust Region Step
• Newton’s Method with a Model Trust Region Modification
• Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
• Safeguarded use of the implicit restarted lanczos technique for solving non‐linear structural eigensystems
• On pseudo—optimal parameter choices and stopping rules for regularization methods in banach spaces_∗

This page was built for publication: Solving large-scale constrained least-squares problems.