A New Block-Splitting Method for Nonnegative Low-Rank Matrix Approximation

Juan Zhang,Kai Deng,Delin Chu

Published 2026 in IEEE Transactions on Knowledge and Data Engineering

ABSTRACT

Nonnegative low-rank matrix approximation is an important technique in data analysis for extracting meaningful patterns from high-dimensional nonnegative data. This nonnegative low-rank approximation problem is studied and a new block-splitting method is developed in this paper. This new method enforces the low-rank constraint by utilizing QR decomposition and adopts a semismooth Newton method to address the related convex subproblems efficiently through the dual formulation of the nonnegative low-rank matrix approximation problem. Theoretical analysis confirms the convergence of the new method. Several real datasets are used to demonstrate the efficiency of the proposed method.

PUBLICATION RECORD

  • Publication year

    2026

  • Venue

    IEEE Transactions on Knowledge and Data Engineering

  • Publication date

    2026-03-01

  • Fields of study

    Mathematics, Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-35 of 35 references · Page 1 of 1

CITED BY

  • No citing papers are available for this paper.

Showing 0-0 of 0 citing papers · Page 1 of 1