JPL Technical Report Server

A Polynomial-time Algorithm for Solving Certain Classes of Rank Minimization Problem

Show simple item record

dc.contributor.author Mesbahi, M. en_US
dc.contributor.author Gurvits, L. en_US
dc.date.accessioned 2004-09-23T23:51:07Z
dc.date.available 2004-09-23T23:51:07Z
dc.date.issued 1999-06-02 en_US
dc.identifier.citation American Control Conference en_US
dc.identifier.citation San Diego, CA, U.S.A. en_US
dc.identifier.clearanceno 99-0776 en_US
dc.identifier.uri http://hdl.handle.net/2014/17332
dc.description.abstract We present a non-interior point based, polynomial-time, algorithm for solving certain classes of rank minimization problem. en_US
dc.format.extent 259062 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.subject.other Rank Minimization under LMI constraints Monotone operators Riccati equation en_US
dc.title A Polynomial-time Algorithm for Solving Certain Classes of Rank Minimization Problem en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account