In this thesis, we present four proximal algorithms for the solution of a nuclear norm optimization problem. Respect to other papers, we solve a more generic version of this problem. Another contribution is related in particular to the model order selection, in fact, we propose to use the parsimony principle. Experimentally with this method, we obtain a better fit with a lower model order
Abstract — This paper concerns model reduction of dynamical systems using the nuclear norm of the Ha...
Nuclear norm based subspace identification methods have recently gained importance due to their abil...
In this paper, a procedure is developed for identifying a number of representative solutions managea...
New system identification methods are developing constantly to come up with solutions that can take ...
Abstract — This paper presents a novel algorithm for efficiently minimizing the nuclear norm of a ma...
The nuclear norm is an effective proxy for matrix rank in a range of minimization problems, includin...
Low-rank inducing unitarily invariant norms have been introduced to convexify problems with low-rank...
We introduce a flexible optimization framework for nuclear norm minimization of matrices with linear...
The question in the title is answered empirically by solving instances of three classical problems: ...
We consider a nuclear norm minimization problem that can be viewed as convex relaxation of rank mini...
Abstract: Subspace identification is a classical and very well studied problem in system identificat...
Abstract: Subspace identification is revisited in the scope of nuclear norm minimization methods. It...
We compare two iterative frequency domain subspace identification methods using nuclear norm minimiz...
A partial proximal point algorithm for nuclear norm regularized matrix least squares problem
Abstract: Subspace identification is a classical and very well studied problem in system identificat...
Abstract — This paper concerns model reduction of dynamical systems using the nuclear norm of the Ha...
Nuclear norm based subspace identification methods have recently gained importance due to their abil...
In this paper, a procedure is developed for identifying a number of representative solutions managea...
New system identification methods are developing constantly to come up with solutions that can take ...
Abstract — This paper presents a novel algorithm for efficiently minimizing the nuclear norm of a ma...
The nuclear norm is an effective proxy for matrix rank in a range of minimization problems, includin...
Low-rank inducing unitarily invariant norms have been introduced to convexify problems with low-rank...
We introduce a flexible optimization framework for nuclear norm minimization of matrices with linear...
The question in the title is answered empirically by solving instances of three classical problems: ...
We consider a nuclear norm minimization problem that can be viewed as convex relaxation of rank mini...
Abstract: Subspace identification is a classical and very well studied problem in system identificat...
Abstract: Subspace identification is revisited in the scope of nuclear norm minimization methods. It...
We compare two iterative frequency domain subspace identification methods using nuclear norm minimiz...
A partial proximal point algorithm for nuclear norm regularized matrix least squares problem
Abstract: Subspace identification is a classical and very well studied problem in system identificat...
Abstract — This paper concerns model reduction of dynamical systems using the nuclear norm of the Ha...
Nuclear norm based subspace identification methods have recently gained importance due to their abil...
In this paper, a procedure is developed for identifying a number of representative solutions managea...