An iterative approach to Rank Minimization Problems

This paper investigates an iterative approach to solve the Rank Minimization Problems (RMPs) constrained in a convex set. The matrix rank function is discontinuous and nonconvex and the general RMP is classified as NP-hard. A continuous function is firstly introduced to approximately represent the matrix rank function with prescribed accuracy by selecting appropriate parameters. The RMPs are then converted to rank constrained optimization problems. An Iterative Rank Minimization (IRM) method is proposed to gradually approach the constrained rank. Convergence proof of the IRM method using the duality theory and Karush-Kuhn-Tucker conditions is provided. Two representative applications of RMP, matrix completion and output feedback stabilization problems, are presented to verify the feasibility and improved performance of the proposed IRM method.

[1]  M. Mesbahi.  On the rank minimization problem and its control applications , 1998 .

[2]  Francis R. Bach,et al.  Low-rank matrix factorization with attributes , 2006, ArXiv.

[3]  Ran Dai,et al.  Spacecraft Attitude Control under Constrained Zones via Quadratically Constrained Quadratic Programming , 2015 .

[4]  R. Dai,et al.  Path Planning of Spatial Rigid Motion with Constrained Attitude , 2015 .

[5]  M. Mesbahi,et al.  On the rank minimization problem , 2004, Proceedings of the 2004 American Control Conference.

[6]  Pierre Apkarian,et al.  An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory , 2001, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[7]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[8]  Maryam Fazel,et al.  Iterative reweighted algorithms for matrix rank minimization , 2012, J. Mach. Learn. Res..

[9]  Karolos M. Grigoriadis,et al.  Low-order control design for LMI problems using alternating projection methods , 1996, Autom..

[10]  Stephen P. Boyd,et al.  Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices , 2003, Proceedings of the 2003 American Control Conference, 2003..

[11]  Laurent El Ghaoui,et al.  Graph weight design for Laplacian eigenvalue constraints with multi-agent systems applications , 2011, IEEE Conference on Decision and Control and European Control Conference.

[12]  Laurent El Ghaoui,et al.  Rank Minimization under LMI constraints: A Framework for Output Feedback Problems , 2007 .

[13]  M. Tomizuka,et al.  Rank minimization approach for solving BMI problems with random search , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[14]  John B. Moore,et al.  A Newton-like method for solving rank constrained linear matrix inequalities , 2006, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[15]  Stephen P. Boyd,et al.  Rank minimization and applications in system theory , 2004, Proceedings of the 2004 American Control Conference.

[16]  L. Ghaoui,et al.  A cone complementarity linearization algorithm for static output-feedback and related problems , 1996, Proceedings of Joint Conference on Control Applications Intelligent Control and Computer Aided Control System Design.

[17]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..

[18]  Inderjit S. Dhillon,et al.  Rank minimization via online learning , 2008, ICML '08.

[19]  Stephen P. Boyd,et al.  A path-following method for solving BMI problems in control , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[20]  Stephen P. Boyd,et al.  A rank minimization heuristic with application to minimum order system approximation , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[21]  Yun-Bin Zhao,et al.  Approximation Theory of Matrix Rank Minimization and Its Application to Quadratic Equations , 2010, 1010.0851.