Results 1  10
of
441
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”
 SIAM Review,
, 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract

Cited by 562 (20 self)
 Add to MetaCart
for the linear transformation defining the constraints, the minimum rank solution can be recovered by solving a convex optimization problem, namely the minimization of the nuclear norm over the given affine space. We present several random ensembles of equations where the restricted isometry property holds
COMPUTATIONAL COMPLEXITY OF TENSOR NUCLEAR NORM
"... Abstract. The main result of this paper is that the weak membership problem in the unit ball of a given norm is NPhard if and only if the weak membership problem in the unit ball of the dual norm is NPhard. Equivalently, the approximation of a given norm is polynomial time if and only if the appro ..."
Abstract
 Add to MetaCart
if the approximation of the dual norm is polynomial time. Using the NPhardness of the approximation of spectral norm of tensors we prove that the approximation of nuclear norm of tensors is NPhard. In addition, we show that bipartite separability of a density matrix is equivalent its corresponding 4tensor having
Reweighted nuclear norm minimization with application to system identification
 Proc. American Control Conference
, 2010
"... Abstract—The matrix rank minimization problem consists of finding a matrix of minimum rank that satisfies given convex constraints. It is NPhard in general and has applications in control, system identification, and machine learning. Reweighted trace minimization has been considered as an iterative ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
as an iterative heuristic for this problem. In this paper, we analyze the convergence of this iterative heuristic, showing that the difference between successive iterates tends to zero. Then, after reformulating the heuristic as reweighted nuclear norm minimization, we propose an efficient gradient
Nuclear norm minimization via active subspace selection.
 In Proceedings of the 31st International Conference on Machine Learning,
, 2014
"... Abstract We describe a novel approach to optimizing matrix problems involving nuclear norm regularization and apply it to the matrix completion problem. We combine methods from nonsmooth and smooth optimization. At each step we use the proximal gradient to select an active subspace. We then find a ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Abstract We describe a novel approach to optimizing matrix problems involving nuclear norm regularization and apply it to the matrix completion problem. We combine methods from nonsmooth and smooth optimization. At each step we use the proximal gradient to select an active subspace. We then find
A Simple Algorithm for Nuclear Norm Regularized Problems
"... Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorithm building upon the recent sparse approximate SDP solver of (Hazan, 2008). The experimental efficiency of our method is ..."
Abstract

Cited by 49 (3 self)
 Add to MetaCart
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorithm building upon the recent sparse approximate SDP solver of (Hazan, 2008). The experimental efficiency of our method
Interference alignment using reweighted nuclear norm minimization
 in IEEE Int. Conf. Acoust., Speech Signal Process
, 2013
"... This paper proposes an algorithm to compute the transmit beamformers for linear interference alignment for the MIMO interference channel and the MIMO interfering multipleaccess/broadcast channel without symbol extensions. We first formulate the interference alignment problem as a rank minimization p ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
problem with linear constraints, then approximate the matrix rank by the nuclear norm. We further propose the use of an iterative reweighted nuclear norm approach and show that adaptive reweighting can significantly improve the algorithm’s ability to find aligned beamformers. Simulation results show
An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems
, 2009
"... ..."
Nuclear normregularized SENSE reconstruction
 Magnetic Reson Imaging
, 2012
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
A Weighted Nuclear Norm Method for Tensor Completion
"... In recent years, tensor completion problem has received a significant amount of attention in computer vision, data mining and neuroscience. It is the higher order generalization of matrix completion. And these can be solved by the convex relaxation which minimizes the tensor nuclear norm instead of ..."
Abstract
 Add to MetaCart
In recent years, tensor completion problem has received a significant amount of attention in computer vision, data mining and neuroscience. It is the higher order generalization of matrix completion. And these can be solved by the convex relaxation which minimizes the tensor nuclear norm instead
Results 1  10
of
441