Nonnegativity Constraints in Numerical Analysis - CiteSeer

More documents

Recommendations

Info

$Math 733: Vector Fields, Differential Forms, and Cohomology$

[29] V. Franc, V. Hlavč, and M. Navara, Sequential coordinate-wise algorithm for nonnegativeleast squares problem, Research report CTU-CMP-2005-06, Center for MachinePerception, Czech Technical University, Prague, Czech Republic, February 2005.[30] P. E. Gill, W. Murray and M. H. Wright, Practical Optimization, Academic, London,1981.[31] A. A. Giordano, F. M. Hsu, Least Square Estimation With Applications To Digital SignalProcessing, John Wiley & Sons, 1985.[32] L. Grippo, M. Sciandrone, On the convergence of the block nonlinear GaussSeidel methodunder convex constraints, Oper. Res. Lett. Vol. 26, N0. 3, pp. 127-136, 2000.[33] D. Guillamet, J. Vitrià, Classifying faces with non-negative matrix factorization, AcceptedCCIA 2002, Castell de la Plana, Spain.[34] D. Guillamet, J. Vitrià, Non-negative matrix factorization for face recognition, LectureNotes in Computer Science. Vol. 2504, 2002, pp. 336–344.[35] M. Hanke, J. G. Nagy and C. R. Vogel, Quasi-newton approach to nonnegative imagerestorations, Linear Algebra Appl., Vol. 316, pp. 223–236, 2000.[36] R. A. Harshman, Foundations of the PARAFAC procedure: models and conditions foran ”explantory” multi-modal factor analysis, UCLA working papers in phonetics, Vol.16, pp. 1–84, 1970.[37] T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning: DataMining, Inference, and Prediction, Springer-Verlag, New York, 2001.[38] P. K. Hopke, Receptor Modeling in Environmental Chemistry, Wiley and Sons, NewYork, 1985.[39] P. K. Hopke, Receptor Modeling for Air Quality Management, Elsevier, Amsterdam,Hetherlands, 1991.[40] P. O. Hoyer, Nonnegative sparse coding, neural networks for signal processing XII, Proc.IEEE Workshop on Neural Networks for Signal Processing, Martigny, 2002.[41] P. Hoyer, Nonnegative matrix factorization with sparseness constraints, J. of Mach.Leanring Res., vol.5, pp.1457–1469, 2004.[42] C. G. Khatri, C. R. Rao, Solutions to some functional equations and their applicationsto. characterization of probability distributions, Sankhya, Vol. 30, pp. 167–180, 1968.[43] B. Kim, Numerical optimization methods for image restoration, Ph.D. thesis, StanfordUniversity, 2002.[44] E. Kim, P. K. Hopke, E. S. Edgerton, Source identification of Atlanta aerosol by positivematrix factorization, J. Air Waste Manage. Assoc., Vol. 53, pp. 731–739, 2003.28
[45] H. Kim, H. Park, Sparse non-negative matrix factorizations via alternating nonnegativity-constrainedleast squares for microarray data analysis, Bioinformatics, Vol.23, No. 12, pp. 1495-1502, 2007.[46] D. Kim, S. Sra, and I. S. Dhillon, A new projected quasi-newton approach for the nonnegativeleast squares problem, Dept. of Computer Sciences, The Univ. of Texas at Austin,Technical Report # TR-06-54, Dec. 2006.[47] D. Kim, S. Sra, and I. S. Dhillon, Fast newton-type methods for the least squares nonnegativematrix approximation problem, To appear in Proceedings of SIAM Conferenceon Data Mining, (2007).[48] S. Kullback, and R. Leibler, On information and sufficiency, Annals of MathematicalStatistics Vol. 22 pp. 79–86, 1951.[49] C. L. Lawson and R. J. Hanson, Solving Least Squares Problems, PrenticeHall, 1987.[50] A. Langville, C. Meyer, R. Albright, J. Cox, D. Duling, Algorithms, initializations, andconvergence for the nonnegative matrix factorization, preprint, 2006.[51] D. Lee and H. Seung, Learning the parts of objects by non-negative matrix factorization,Nature Vol. 401, pp. 788-791, 1999.[52] D. Lee and H. Seung, Algorithms for nonnegative matrix factorization, Advances inNeural Information Processing Systems, Vol. 13, pp. 556–562, 2001.[53] S. Z. Li, X. W. Hou and H. J. Zhang, Learning spatially localized, parts-based representation,IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–6,2001.[54] C. J. Lin, Projected gradient methods for non-negative matrix factorization. TechnicalReport Information and Support Services Technical Report ISSTECH-95-013, Departmentof Computer Science, National Taiwan University.[55] C. J. Lin, Projected gradient methods for non-negative matrix factorization, to appearin Neural Computation, 2007.[56] W. Liu, J. Yi, Existing and new algorithms for nonnegative matrix factorization, Universityof Texas at Austin, 2003, report.[57] A. Mazer, M. Martin, M. Lee and J. Solomon, Image processing software for imagingspectrometry data analysis, Remote Sensing of Environment, Vol. 24, pp. 201–220, 1988.[58] P. Matstoms, snnls: a matlab toolbox for Solve sparse linear least squarest problemwith nonnegativity constraints by an active set method, 2004, available athttp://www.math.liu.se/ milun/sls/.[59] J. J. Moré, G. Toraldo, On the solution of large quadratic programming problems withbound constraints, SIAM Journal on Optimization, Vol. 1, No. 1, pp. 93-113, 1991.29
Page 1: Nonnegativity Constraints in Numeri
Page 5: NNLS Problem:Given a matrix A ∈ R
Page 8 and 9: However, when applied in a straight
Page 10 and 11: the active set method fnnls. It als
Page 12 and 13: Block principal pivoting algorithm:
Page 14 and 15: 4.1 Nonnegative Matrix Factorizatio
Page 16 and 17: algorithms can be very fast. The im
Page 18 and 19: Furthermore, the product T (m×np)
Page 20 and 21: 5.2 Image Processing and Computer V
Page 22 and 23: 5.4 Environmetrics and Chemometrics
Page 24 and 25: Figure 3: Artist rendition of a JSA
Page 26 and 27: References[1] S. Bellavia, M. Macco
Page 30 and 31: [60] J. G. Nagy, Z. Strakoš, Enfor
Page 32: [89] R. S. Varga, Matrix Iterative

Nonnegativity Constraints in Numerical Analysis - CiteSeer

Create successful ePaper yourself

Delete template?

Save as template?