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

Gurvits, L.; Mesbahi, M.

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

Rank Minimization under LMI constraints Monotone operators Riccati equation

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Gurvits, L., Mesbahi, M.. 1999-06-02. A Polynomial-time Algorithm for Solving Certain Classes of Rank Minimization Problem. https://ntrs.nasa.gov/citations/20210001120

Cite the original work for its findings. Save a collection to share your selection of sources.