NASA NTRS · 20210001120
A Polynomial-time Algorithm for Solving Certain Classes of Rank Minimization Problem
Abstract
We present a non-interior point based, polynomial-time, algorithm for solving certain classes of rank minimization problem.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Gurvits, L., Mesbahi, M.. 1999-06-02. A Polynomial-time Algorithm for Solving Certain Classes of Rank Minimization Problem. https://searchnasa.com/record/nasa%3A20210001120/a-polynomial-time-algorithm-for-solving-certain-classes-of-rank-minimization-problem
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.