On optimal low-rank approximation of non-negative matrices

Christian Grussler, Anders Rantzer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication54rd IEEE Conference on Decision and Control,CDC 2015
Pages5278-5283
Number of pages6
ISBN (Electronic)9781479978861
DOIs
StatePublished - 8 Feb 2015
Externally publishedYes
Event54th IEEE Conference on Decision and Control, CDC 2015 - Osaka, Japan
Duration: 15 Dec 201518 Dec 2015

Publication series

NameProceedings of the IEEE Conference on Decision and Control
Volume54rd IEEE Conference on Decision and Control,CDC 2015

Conference

Conference54th IEEE Conference on Decision and Control, CDC 2015
Country/TerritoryJapan
CityOsaka
Period15/12/1518/12/15

Keywords

  • Computational modeling
  • Conferences
  • Context
  • Convex functions
  • Image analysis
  • Programming
  • Standards

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'On optimal low-rank approximation of non-negative matrices'. Together they form a unique fingerprint.

Cite this