On iterative algorithms for linear least squares problems with bound constraints (Q756372): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Michel Bierlaire / rank
 
Normal rank
Property / author
 
Property / author: Phillipe L. Toint / rank
 
Normal rank
Property / author
 
Property / author: Daniel Tuyttens / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Sanjo Zlobec / rank
 
Normal rank

Revision as of 01:50, 11 February 2024

scientific article
Language Label Description Also known as
English
On iterative algorithms for linear least squares problems with bound constraints
scientific article

    Statements

    On iterative algorithms for linear least squares problems with bound constraints (English)
    0 references
    1991
    0 references
    This paper has been inspired by recent developments in trust region methods for solving nonlinear optimization problems with simple bounds. Two new projected gradient methods are described for solving the constrained least-squares problem: \(Min\{\| Ax-b\|:\ell \leq x\leq u\}\). Which of the two methods is preferable is problem dependent. However, their performance on a wide class of problems is claimed to be superior to the authors' improvement (for large scale problems) of an algorithm proposed by \textit{P. Lötstedt} [BIT 24, 206-224 (1984; Zbl 0546.65041)].
    0 references
    trust region methods
    0 references
    nonlinear optimization problems
    0 references
    projected gradient methods
    0 references
    constrained least-squares problem
    0 references
    large scale problems
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references