A rank-corrected procedure for matrix completion with fixed basis coefficients
type: Item
instance of: scholarly article
title: A rank-corrected procedure for matrix completion with fixed basis coefficients
zbMATH Open document ID: 1356.90178
author: Weimin Miao
author: Shaohua Pan
author: Defeng Sun
published in: Mathematical Programming. Series A. Series B
publication date: 2016-09-16T00:00:00Z
full work available at URL: https://arxiv.org/abs/1210.3709
review text: The authors consider the matrix completion problem as well as an adaptive nuclear semi-norm technique for its solution. In particular, they propose a rank-corrected procedure which uses a nuclear semi-norm for generating a new estimator. Here, they quantify the reduction of the recovery error bound. Finally, several numerical experiments illustrate the presented results.
reviewed by: Jan-Joachim Rückmann
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 6627814
zbMATH Keywords: matrix completion
zbMATH Keywords: fixed basis coefficients
zbMATH Keywords: low-rank
zbMATH Keywords: convex optimization
zbMATH Keywords: rank consistency
zbMATH Keywords: constraint nondegeneracy
MaRDI profile type: Publication
OpenAlex ID: W2962771824
arXiv ID: 1210.3709
cites work: Cox's regression model for counting processes: A large sample study
cites work: ON MATRICES DEPENDING ON PARAMETERS
cites work: Q3096144
cites work: Q5690490
cites work: Q4503250
cites work: Statistics for high-dimensional data. Methods, theory and applications.
cites work: Exact matrix completion via convex optimization
cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion
cites work: An introduction to a class of matrix cone programming
cites work: Least angle regression. (With discussion)
cites work: Comments on «Wavelets in statistics: A review» by A. Antoniadis
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: Sure Independence Screening for Ultrahigh Dimensional Feature Space
cites work: A Selective Overview of Variable Selection in High Dimensional Feature Space (Invited Review Article)
cites work: Nonconcave penalized likelihood with a diverging number of parameters.
cites work: Relaxed Lasso
cites work: Nonsmooth analysis of singular values. II: Applications
cites work: Hankel matrix rank minimization with applications to system identification and realization
cites work: Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
cites work: Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
cites work: Von Neumann entropy penalization and low-rank matrix estimation
cites work: Noisy low-rank matrix completion with general sampling distribution
cites work: Rank penalized estimators for high-dimensional matrices
cites work: On the asymptotics of constrained \(M\)-estimation
cites work: Recovering Low-Rank Matrices From Few Coefficients in Any Basis
cites work: GMM with Many Moment Conditions
cites work: Q3543468
cites work: An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
cites work: A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
cites work: Solving Nuclear Norm Regularized and Semidefinite Matrix Least Squares Problems with Linear Equality Constraints
cites work: Matrix completion from noisy entries
cites work: Epi‐consistency of convex stochastic programs
cites work: Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
cites work: Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
cites work: Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
cites work: Q3997990
cites work: Q3431917
cites work: Inequalities: theory of majorization and its applications
cites work: High-dimensional graphs and variable selection with the Lasso
cites work: On the rank minimization problem and its control applications
cites work: On the rank minimization problem over a positive semidefinite linear matrix inequality
cites work: Q5405230
cites work: Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
cites work: Q4942384
cites work: Asymptotic Stochastic Programs
cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
cites work: An augmented Lagrangian dual approach for the H-weighted nearest correlation matrix problem
cites work: A Simpler Approach to Matrix Completion
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
cites work: Convex Analysis
cites work: Variational Analysis
cites work: Estimation of high-dimensional low-rank matrices
cites work: Global existence of classical solutions to a predator-prey model with nonlinear prey-taxis
cites work: Q4864293
cites work: User-friendly tail bounds for sums of random matrices
cites work: Weak convergence and empirical processes. With applications to statistics

A rank-corrected procedure for matrix completion with fixed basis coefficients (cites work)
cites work: Asymptotic equivalence of quantum state tomography and noisy matrix completion

A rank-corrected procedure for matrix completion with fixed basis coefficients (cites work)
cites work: Characterization of the subdifferential of some matrix norms

A rank-corrected procedure for matrix completion with fixed basis coefficients (cites work)
cites work: On matrix approximation problems with Ky Fan \(k\) norms

A rank-corrected procedure for matrix completion with fixed basis coefficients (cites work)
cites work: Nearly unbiased variable selection under minimax concave penalty

A rank-corrected procedure for matrix completion with fixed basis coefficients (cites work)
cites work: Q3174050

A rank-corrected procedure for matrix completion with fixed basis coefficients (cites work)
cites work: The Adaptive Lasso and Its Oracle Properties

A rank-corrected procedure for matrix completion with fixed basis coefficients (cites work)
cites work: One-step sparse estimates in nonconcave penalized likelihood models

A rank-corrected procedure for matrix completion with fixed basis coefficients (DOI)
DOI: 10.1007/S10107-015-0961-7