Solving large-scale constrained least-squares problems. (Q1406109): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Safeguarded use of the implicit restarted lanczos technique for solving non‐linear structural eigensystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit shift bidiagonalization algorithm for ill-posed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares with a quadratic constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratically constrained least squares and quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pseudo—optimal parameter choices and stopping rules for regularization methods in banach spaces<sub>∗</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton’s Method with a Model Trust Region Modification / rank
 
Normal rank

Revision as of 09:52, 6 June 2024

scientific article
Language Label Description Also known as
English
Solving large-scale constrained least-squares problems.
scientific article

    Statements

    Solving large-scale constrained least-squares problems. (English)
    0 references
    9 September 2003
    0 references
    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.
    0 references
    regularized least-squares problem
    0 references
    local convergence
    0 references
    parameterized eigenvalue problem
    0 references
    superlinear convergence
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers