Algorithm 587
Algorithm 587: Two Algorithms for the Linearly Constrained Least Squares Problem
(Source: http://plato.asu.edu)
This software is also peer reviewed by journal TOMS.
This software is also peer reviewed by journal TOMS.
Keywords for this software
References in zbMATH (referenced in 9 articles )
Showing results 1 to 9 of 9.
Sorted by year (- Beliakov, Gleb; Calvo, Tomasa: Interpolatory type construction of general aggregation operators (2008)
- Beliakov, Gleb: Learning weights in the generalized OWA operators (2005)
- Voss, Henning U.; Timmer, Jens; Kurths, Jürgen: Nonlinear dynamical system identification from uncertain and indirect measurements. (2004)
- Beliakov, G.: How to build aggregation operators from data (2003)
- Beliakov, G.: Monotone approximation of aggregation operators using least squares splines. (2002)
- Dadurkevičius, Virgis: Remark on algorithm 587 (1989)
- Hanson, R.J.: On the constrained linear least-squares problem: A personal view (1987)
- Hanson, Richard J.: Linear least squares with bounds and linear constraints (1986)
- Lenard, Melanie L.; Minkoff, Michael: Randomly generated test problems for positive definite quadratic programming (1984)