Suppose that we have a matrix $\mathbf{A}\in\mathbb{R}^{n\times p}$. If we want to find an approximation of $\mathbf{A}$ with maximum rank $k$, which is denoted as $\tilde{\mathbf{A}}$, is it possible to solve the following
$$\left\{\tilde{\mathbf{P}},\tilde{\mathbf{Q}}\right\} = \underset{\begin{aligned}\mathbf{P}\in\mathbb{R}^{n\times k}\\\mathbf{Q}\in\mathbb{R}^{p\times k}\end{aligned}}{\arg \min}~~~\left\|\mathbf{A}-\mathbf{P}\mathbf{Q}^\top\right\|_{\text{F}}^2$$ in an alternative way and simply let $\tilde{\mathbf{A}}=\tilde{\mathbf{P}}\cdot\tilde{\mathbf{Q}}^\top$?
Note that the constraint of a rank no more than $k$ is implied by the dimensions of $\mathbf{P}$ and $\mathbf{Q}$.
Any help is appreciated.