On optimal low-rank approximation of non-negative matrices

Summary, in English

For low-rank Frobenius-norm approximations of matrices with non-negative entries, it is shown that the Lagrange dual is computable by semi-definite programming. Under certain assumptions the duality gap is zero. Even when the duality gap is non-zero, several new insights are provided.

• Författare: Christian Grussler; Anders Rantzer
• Avdelning/ar: Institutionen för reglerteknik; ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publiceringsår: 2015
• Språk: Engelska
• Sidor: 5278-5283
• Publikation/Tidskrift/Serie: 2015 IEEE 54th Annual Conference on Decision and Control (CDC)
• Fulltext: - 215 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/CDC.2015.7403045
• Dokumenttyp: Konferensbidrag
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Control Engineering
• Nyckelord: Computational modeling; Conferences; Context; Convex functions; Image analysis; Programming; Standards
• Conference name: 54th IEEE Conference on Decision and Control, CDC 2015
• Conference date: 2015-12-15 - 2015-12-18
• Conference place: Osaka, Japan
• Status: Published
• ISBN/ISSN/Övrigt: ISBN: 978-1-4799-7886-1