Solving large-scale constrained least-squares problems.
An algorithm for solving large scale regularized least-squares problems subject to quadratic inequality constraints is presented. The algorithm is based on recasting the considered problem into a parameterized eigenvalue problem. The main contribution is twofold. The first is related with the given comprehensive understanding of the problem, and the second is related with the development of different solutions of the problem. A convergence analysis for the considered algorithm is given. It is proved that this algorithm converges superlinearly.
- Publication:4945656
- scientific article; zbMATH DE number 1367595
- Parameterized eigensolution technique for solving constrained least squares problems∗
- An iterative algorithm for large size least-squares constrained regularization problems
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization
- An implicit shift bidiagonalization algorithm for ill-posed systems
- Computing a Trust Region Step
- scientific article; zbMATH DE number 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 1367595 (Why is no real title available?)
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Least squares with a quadratic constraint
- Newton’s Method with a Model Trust Region Modification
- On pseudo—optimal parameter choices and stopping rules for regularization methods in banach spaces∗
- Quadratically constrained least squares and quadratic problems
- Safeguarded use of the implicit restarted lanczos technique for solving non‐linear structural eigensystems
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- Recursive least squares with linear inequality constraints
- On the complex least squares problem with constrained phase
- scientific article; zbMATH DE number 3913569 (Why is no real title available?)
- Parameterized eigensolution technique for solving constrained least squares 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?)
- An iterative algorithm for large size least-squares constrained regularization problems
- Least squares problems with inequality constraints as quadratic constraints
This page was built for publication: Solving large-scale constrained least-squares problems.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406109)
