Loading...

Rank minimization using sums of squares of nonnegative matrices

Sadati, N ; Sharif University of Technology | 2006

221 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/cdc.2006.377719
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2006
  4. Abstract:
  5. Recently, moment dual approach of sums of squares relaxations developed for polynomial optimization problems was successfully extended to optimization problems with polynomial matrix inequality constraints. In this paper, we first derive an efficient polynomial formulization for matrix rank minimization problem which does not add any slack variable or additional equality or inequality constraint. Using the aforementioned theory, then we propose a hierarchy of convex LMI relaxations to provide a sequence of increasingly tight lower bounds on the global minimum rank of an arbitrary matrix under linear and polynomial matrix inequality constraints. Surprisingly enough, these lower bounds are usually exact and the optimal rank is often attained at early stages of the algorithm, make it possible to extract all optimal minimzers using Curto-Fialkow flat extension results. Special issues on complexity, implementation and numerical results are also properly addressed. © 2006 IEEE
  6. Keywords:
  7. Computational complexity ; Linear matrix inequalities ; Linear systems ; Optimization ; Polynomials ; Problem solving ; Inequality constraint ; Matrix rank minimization ; Nonnegative matrices ; Polynomial formulization ; Relaxation processes
  8. Source: 45th IEEE Conference on Decision and Control 2006, CDC, San Diego, CA, 13 December 2006 through 15 December 2006 ; 2006 , Pages 1492-1497 ; 01912216 (ISSN); 1424401712 (ISBN); 9781424401710 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4177228