Pages that link to "Item:Q3586174"

The following pages link to Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization (Q3586174):

Displaying 50 items.

• Geometric median and robust estimation in Banach spaces (Q122792) (← links)
• Latent variable graphical model selection via convex optimization (Q132216) (← links)
• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• Parallel matrix factorization for low-rank tensor completion (Q256035) (← links)
• An alternating direction method with continuation for nonconvex low rank minimization (Q257130) (← links)
• On two continuum armed bandit problems in high dimensions (Q260274) (← links)
• A novel robust principal component analysis method for image and video processing. (Q265164) (← links)
• Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems (Q276859) (← links)
• On the construction of general cubature formula by flat extensions (Q281965) (← links)
• Optimal large-scale quantum state tomography with Pauli measurements (Q282466) (← links)
• The minimal rank of matrix expressions with respect to Hermitian matrix-revised (Q285690) (← links)
• Minimum \( n\)-rank approximation via iterative hard thresholding (Q299732) (← links)
• A new gradient projection method for matrix completion (Q300199) (← links)
• On the nuclear norm and the singular value decomposition of tensors (Q300892) (← links)
• A proximal method for composite minimization (Q304260) (← links)
• Geometric inference for general high-dimensional linear inverse problems (Q309721) (← links)
• A rank-corrected procedure for matrix completion with fixed basis coefficients (Q312678) (← links)
• Sharp MSE bounds for proximal denoising (Q330102) (← links)
• On the need for structure modelling in sequence prediction (Q331679) (← links)
• An improved robust ADMM algorithm for quantum state tomography (Q332021) (← links)
• Tucker factorization with missing data with application to low-\(n\)-rank tensor completion (Q335961) (← links)
• Checking strict positivity of Kraus maps is NP-hard (Q344532) (← links)
• Improved recovery guarantees for phase retrieval from coded diffraction patterns (Q347510) (← links)
• Low rank matrix recovery from rank one measurements (Q347516) (← links)
• Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (Q354616) (← links)
• Low rank estimation of smooth kernels on graphs (Q355091) (← links)
• A variational approach of the rank function (Q356507) (← links)
• Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit (Q368099) (← links)
• \(s\)-goodness for low-rank matrix recovery (Q369686) (← links)
• Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
• Simple bounds for recovering low-complexity models (Q378116) (← links)
• Some optimization problems on ranks and inertias of matrix-valued functions subject to linear matrix equation restrictions (Q380304) (← links)
• Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
• Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis (Q389667) (← links)
• High-dimensional covariance matrix estimation with missing observations (Q395991) (← links)
• Exact minimum rank approximation via Schatten \(p\)-norm minimization (Q396052) (← links)
• Sharp recovery bounds for convex demixing, with applications (Q404302) (← links)
• An approximation theory of matrix rank minimization and its application to quadratic equations (Q417562) (← links)
• Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications (Q426078) (← links)
• An implementable proximal point algorithmic framework for nuclear norm minimization (Q431025) (← links)
• Learning functions of few arbitrary linear parameters in high dimensions (Q434415) (← links)
• Uniqueness conditions for low-rank matrix recovery (Q442534) (← links)
• Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions (Q447861) (← links)
• A kernel-based framework to tensorial data analysis (Q456010) (← links)
• An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion (Q460667) (← links)
• Guaranteed clustering and biclustering via semidefinite programming (Q463740) (← links)
• Sparse recovery on Euclidean Jordan algebras (Q471921) (← links)
• Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing (Q474971) (← links)
• A new approximation of the matrix rank function and its application to matrix rank minimization (Q481777) (← links)
• Minimax risk of matrix denoising by singular value thresholding (Q482895) (← links)