International audienceWe study the problem of decomposing a measured signal as a sum of decaying exponentials. There is a direct connection to sums of these types and positive semi-definite (PSD) Hankel matrices, where the rank of these matrices equals the number of exponentials. We propose to solve the identification problem by forming an optimization problem with a misfit function combined with a rank penalty function that also ensures the PSD-constraint. This problem is non-convex, but we show that it is possible to compute the minimum of an explicit closely related convexified problem. Moreover, this minimum can be shown to often coincide with the minimum of the original non-convex problem, and we provide a simple criterion that enables...
This paper considers the problem of finding a low rank matrix from observations of linear combinatio...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
This paper considers the problem of finding a low rank matrix from observations of linear combinatio...
International audienceWe study the problem of decomposing a measured signal as a sum of decaying exp...
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. ...
Given underdetermined measurements of a positive semi-definite (PSD) matrix X of known low rank K, w...
The problem of finding a low rank approximation of a given measurement matrix is of key interest in ...
We introduce a flexible optimization framework for nuclear norm minimization of matrices with linear...
Spectral estimation is an important classical problem that has received considerable attention in th...
We consider the weighted low rank approximation of the positive semidefinite Hankel matrix problem a...
The problem of low-rank approximation with convex constraints, which appears in data analysis, syste...
Applications of semidefinite optimization in signal processing are often derived from the Kalman–Yaku...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matri...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
This paper considers the problem of finding a low rank matrix from observations of linear combinatio...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
This paper considers the problem of finding a low rank matrix from observations of linear combinatio...
International audienceWe study the problem of decomposing a measured signal as a sum of decaying exp...
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. ...
Given underdetermined measurements of a positive semi-definite (PSD) matrix X of known low rank K, w...
The problem of finding a low rank approximation of a given measurement matrix is of key interest in ...
We introduce a flexible optimization framework for nuclear norm minimization of matrices with linear...
Spectral estimation is an important classical problem that has received considerable attention in th...
We consider the weighted low rank approximation of the positive semidefinite Hankel matrix problem a...
The problem of low-rank approximation with convex constraints, which appears in data analysis, syste...
Applications of semidefinite optimization in signal processing are often derived from the Kalman–Yaku...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matri...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
Rank deficiency of a data matrix is equivalent to the existence of an exact linear model for the dat...
This paper considers the problem of finding a low rank matrix from observations of linear combinatio...
Abstract. We consider the problem of approximating an affinely structured matrix, for example, a Han...
This paper considers the problem of finding a low rank matrix from observations of linear combinatio...