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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Goldstein-Levitin-Polyak gradient projection method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enlarging the region of convergence of Newton's method for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct method for sparse least squares problems with lower and upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Restricted and Interval Least-Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex programming in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison Between Some Direct and Iterative Methods for Certain Large Scale Geodetic Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Least Squares with Bounds and Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Methods for Large Sparse Linear Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the minimal least squares problem subject to bounds on the variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Simulation of Time-Dependent Contact and Friction Problems in Rigid Body Mechanics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for bound constrained quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized conjugate gradient algorithm for solving a class of quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Statistical Model for Positron Emission Tomography / rank
 
Normal rank

Latest revision as of 14:05, 21 June 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references