Abstract: Many problems of system identification, model reduction and signal processing can be posed and solved as a structured low-rank approximation problem. In this paper a reformulation of the structured low-rank approximation problem as minimization of a multivariate rational function is considered. Using two different parametrizations, we show that the problem reduces to optimization over a compact manifold or to a set of optimization problems over bounded domains of Euclidean space. We make a review of methods of polynomial algebra for global optimization of the rational cost function. 1
atrix low-rank approximation is intimately related to data modelling; a problem that arises frequent...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Many problems of system identification, model reduction and signal processing can be posed and solve...
A number of problems in system theory, signal processing, and computer algebra fit into a generic st...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
Abstract—The low-rank approximation problem is to approx-imate optimally, with respect to some norm,...
In this paper we illustrate some optimization challenges in the structured low rank approximation (S...
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
In this paper we illustrate some optimization challenges in the structured low rank approximation (S...
In this paper we illustrate some optimization challenges in the structured low rank approximation (S...
The low-rank approximation problem is to approximate optimally, with respect to some norm, a matrix ...
atrix low-rank approximation is intimately related to data modelling; a problem that arises frequent...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Many problems of system identification, model reduction and signal processing can be posed and solve...
A number of problems in system theory, signal processing, and computer algebra fit into a generic st...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
In this paper, we consider the so-called structured low rank approximation (SLRA) problem as a probl...
Abstract—The low-rank approximation problem is to approx-imate optimally, with respect to some norm,...
In this paper we illustrate some optimization challenges in the structured low rank approximation (S...
Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequen...
In this paper we illustrate some optimization challenges in the structured low rank approximation (S...
In this paper we illustrate some optimization challenges in the structured low rank approximation (S...
The low-rank approximation problem is to approximate optimally, with respect to some norm, a matrix ...
atrix low-rank approximation is intimately related to data modelling; a problem that arises frequent...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...