• Home
  • Search
  • A subspace-approximating algorithm for matrix completion
  • Cite Icon1
  • https://doi.org/10.1360/n012016-00025Copy DOI Icon

A subspace-approximating algorithm for matrix completion

Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

In this paper, we propose a new subspace-approximating algorithm for matrix completion based on the subspace-approximating of the singular value decomposition.Then we use quadratic programming to produce the closest and the best feasible matrix in the subspace. This algorithm can achieve the reduction of the rank of the subspace by gradually reducing the number of the singular value of the thresholding and get the optimal low-rank matrix. It is proved that the subspace-approximating algorithm is convergent under some conditions. Besides, compared with the augmented Lagrange multiplier algorithm and orthogonal rank-one matrix pursuit algorithm by random experiments,the proposed algorithm is more effective in the CPU time and the low-rank property.

Similar Papers
  • Conference Article
  • Citations2

An ALM matrix completion algorithm for recovering weather monitoring data

  • Jun 01, 2016
  • Yuqing Chen +2
  • Conference Article
  • Citations2

Global Abnormal Event Detection Based on Compact Coefficient Low-Rank Dictionary Learning

  • Nov 01, 2017
  • Ang Li +2
  • Research Article
  • Citations64

Double Low-Rank Matrix Decomposition for Hyperspectral Image Denoising and Destriping

  • Mar 10, 2021
  • IEEE Transactions on Geoscience and Remote Sensing
  • Hongyan Zhang +4
  • Research Article
  • Citations11

A novel non-convex low-rank tensor approximation model for hyperspectral image restoration

  • May 24, 2021
  • Applied Mathematics and Computation
  • Jie Lin +5
  • Research Article
  • Citations112

Optimum selection of machining conditions in abrasive flow machining using neural network

  • Nov 13, 2000
  • Journal of Materials Processing Technology
  • Rajendra Kumar Jain +1
  • Book Chapter

Robust Graph Construction

  • Jan 01, 2017
  • Sheng Li +1
  • PDF
  • Research Article
  • Citations2

A Singular Value Thresholding with Diagonal-Update Algorithm for Low-Rank Matrix Completion

  • Dec 24, 2020
  • Mathematical Problems in Engineering
  • Yong-Hong Duan +2
  • Research Article
  • Citations24

Shared-memory and shared-nothing stochastic gradient descent algorithms for matrix completion

  • Feb 15, 2014
  • Knowledge and Information Systems
  • Faraz Makari +4
  • Research Article
  • Citations6

Comparison of Various Orthogonal Polynomials in hp-Version Time Finite Element Method

  • Apr 01, 1998
  • AIAA Journal
  • Sungho Park +1
  • Research Article

INT-MC: Low-Overhead In-Band Network-Wide Telemetry Based on Matrix Completion

  • Jun 16, 2025
  • ACM SIGMETRICS Performance Evaluation Review
  • Xin Zeng +7
  • Research Article

Tensorized Multi-View Subspace Clustering via Tensor Nuclear Norm and Block Diagonal Representation

  • Aug 22, 2025
  • Mathematics
  • Gan-Yi Tang +3
  • Conference Article
  • Citations2

Selection of rules by orthogonal transformations and genetic algorithms to improve the interpretability in fuzzy rule based systems

  • Jul 01, 2013
  • M Isabel Rey +3
  • Book Chapter

Balanced Orthogonal Multi-Wavelet Blind Equalization Algorithm Based on Coordinate Transformation

  • Jan 01, 2011
  • Yecai Guo +1
  • Research Article
  • Citations2

Improved “Augmented MVDR Spectrum-Based Frequency Estimation Algorithm” for Unbalanced Power Systems

  • Jan 01, 2021
  • IEEE Transactions on Instrumentation and Measurement
  • Kyou Jung Son +3
  • Research Article
  • Citations628

Low-Rank Matrix Completion by Riemannian Optimization

  • Jan 01, 2013
  • SIAM Journal on Optimization
  • Bart Vandereycken
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.