On iterative algorithms for linear least squares problems with bound constraints

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

    Research output: Contribution to journalArticle

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)111-143
    Number of pages33
    JournalLinear Algebra and its Applications
    Volume143
    Issue numberC
    Publication statusPublished - 1 Jan 1991

    Fingerprint Dive into the research topics of 'On iterative algorithms for linear least squares problems with bound constraints'. Together they form a unique fingerprint.

  • Projects

    Student Theses

    Large-scale nonlinear network optimization

    Author: Tuyttens, D., 1991

    Supervisor: Toint, P. (Supervisor), Fincham, A. (External person) (Jury) & Escudero, L. (External person) (Jury)

    Student thesis: Doc typesDoctor of Sciences

    Optimization for random utility models

    Author: Bierlaire-Hancotte, M., 1996

    Supervisor: Toint, P. (Supervisor), Polak, J. (External person) (Jury) & Axhausen, K. (External person) (Jury)

    Student thesis: Doc typesDoctor of Sciences

    Cite this