On optimal low-rank approximation of non-negative matrices
Author
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.
Department/s
Publishing year
2015
Language
English
Pages
5278-5283
Publication/Series
2015 IEEE 54th Annual Conference on Decision and Control (CDC)
Full text
- Available as PDF - 215 kB
- Download statistics
Document type
Conference paper
Publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
Topic
- Control Engineering
Keywords
- 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/Other
- ISBN: 978-1-4799-7886-1