Least squares algorithms under unimodality and non-negativity constraints

✍ Scribed by Rasmus Bro; Nicholaos D. Sidiropoulos

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 264 KB
• Volume: 12
• Category: Article
• ISSN: 0886-9383
• DOI: 10.1002/(sici)1099-128x(199807/08)12:4<223::aid-cem511>3.0.co;2-2

✦ Synopsis

In this paper a least squares method is developed for minimizing jjY À XB T jj 2 F over the matrix B subject to the constraint that the columns of B are unimodal, i.e. each has only one peak, and jjMjj 2 F being the sum of squares of all elements of M. This method is directly applicable in many curve resolution problems, but also for stabilizing other problems where unimodality is known to be a valid assumption. Typical problems arise in certain types of time series analysis such as chromatography or flow injection analysis. A fundamental and surprising result of this work is that unimodal least squares regression (including optimization of mode location) is not any more difficult than two simple Kruskal monotone regressions. This had not been realized earlier, leading to the use of either undesirable ad hoc methods or very time-consuming exhaustive search algorithms. The new method is useful in and exemplified with two-and multi-way methods based on alternating least squares regression solving problems from fluorescence spectroscopy and flow injection analysis.