A globally convergent flow for computing the best low rank approximation of a matrix
| dc.creator | Driessel, Kenneth R. | |
| dc.date | 2007-02-21 | |
| dc.date.accessioned | 2026-07-07T07:48:03Z | |
| dc.date.available | 2026-07-07T07:48:03Z | |
| dc.description | We work in the space of $m$-by-$n$ real matrices with the Frobenius inner product. Consider the following Problem: Given an m-by-n real matrix A and a positive integer k, find the m-by-n matrix with rank k that is closest to A. I discuss a rank-preserving differential equation (d.e.) which solves this problem. If X(t) is a solution of this d.e., then the distance between $X(t)$ and $A$ decreases as t increases; this distance function is a Lyapunov function for the d.e. If $A$ has distinct positive singular values (which is a generic condition) then this d.e. has only one stable equilibrium point. The other equilibrium points are finite in number and unstable. In other words, the basin of attraction of the stable equilibrium point on the manifold of matrices with rank $k$ consists of almost all matrices. This special equilibrium point is the solution of the given problem. Usually constrained optimization problems have many local minimums (most of which are undesirable). So the constrained optimization problem considered here is very special. | |
| dc.identifier | https://arxiv.org/abs/math/0702621 | |
| dc.identifier | http://arxiv.org/abs/math/0702621 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/124367 | |
| dc.subject | Optimization and Control | |
| dc.subject | Dynamical Systems | |
| dc.subject | 15A03 (Primary) 15A18 (Secondary) | |
| dc.title | A globally convergent flow for computing the best low rank approximation of a matrix | |
| dc.type | text |