Maximum rank matrix completion
An algorithm is proposed to find a maximum rank matrix completion. The algorithm is based on an algebraic algorithm for maximum cardinality matching. The problem, i.e. filling in the unknown entries of the matrix in such a way as to maximize the rank, is attained by perturbing an arbitrary completion in a greedy way.
scientific article; zbMATH DE number 1331343