On iterative algorithms for linear least squares problems with bound constraints

Michel Bierlaire, Ph.L. Toint, D. Tuyttens

    Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

    Résumé

    Three new iterative methods for the solution of the linear least squares problem with bound constraints are presented and their performance analyzed. The first is a modification of a method proposed by Lötstedt, while the two others are characterized by a technique allowing for fast active set changes, resulting in noticeable improvements in the speed with which constraints active at the solution are identified. The numerical efficiency of those algorithms is experimentally studied, with particular emphasis on the dependence on the starting point and the use of preconditioning for ill-conditioned problems. © 1991.
    langue originaleAnglais
    Pages (de - à)111-143
    Nombre de pages33
    journalLinear Algebra and its Applications
    Volume143
    Numéro de publicationC
    Etat de la publicationPublié - 1 janv. 1991

    Empreinte digitale Examiner les sujets de recherche de « On iterative algorithms for linear least squares problems with bound constraints ». Ensemble, ils forment une empreinte digitale unique.

    Contient cette citation