An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices

DOI10.1007/s10618-021-00773-5zbMath1483.68307OpenAlexW3173431746WikidataQ114226916 ScholiaQ114226916MaRDI QIDQ2238337

Jiayi Tang, Zhong Wan, Ting Li

Publication date: 1 November 2021

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10618-021-00773-5

zbMATH Keywords

convergence analysisprojection methodline searchnonnegative matrix factorizationBarzilai-Borwein algorithm

Mathematics Subject Classification ID

Factorization of matrices (15A23) Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Positive matrices and their generalizations; cones of matrices (15B48) Numerical linear algebra (65F99)

Related Items (2)

An efficient modified residual-based algorithm for large scale symmetric nonlinear equations by approximating successive iterated gradients ⋮ A new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clustering

Uses Software

• NeNMF

Cites Work

• Unnamed Item
• Unnamed Item
• A new nonmonotone spectral residual method for nonsmooth nonlinear equations
• Efficient nonnegative matrix factorization via projected Newton method
• A continuous characterization of the maximum-edge biclique problem
• Orthogonal dual graph-regularized nonnegative matrix factorization for co-clustering
• Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization
• Algorithms and applications for approximate nonnegative matrix factorization
• An extended nonmonotone line search technique for large-scale unconstrained optimization
• Quadratic regularization projected Barzilai-Borwein method for nonnegative matrix factorization
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• A class of modified FR conjugate gradient method and applications to non-negative matrix factorization
• An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization
• Nonnegative matrix factorization for spectral data analysis
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• NEW ADAPTIVE BARZILAI–BORWEIN STEP SIZE AND ITS APPLICATION IN SOLVING LARGE-SCALE OPTIMIZATION PROBLEMS
• A New Active Set Algorithm for Box Constrained Optimization
• On the Complexity of Nonnegative Matrix Factorization
• On the rate of convergence of the image space reconstruction algorithm
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• Two-Point Step Size Gradient Methods
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
• Fast Projection‐Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
• An Adaptive Nonmonotone Projected Barzilai-Borwein Gradient Method with Active Set Prediction for Nonnegative Matrix Factorization
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Independent Component Analysis and Blind Signal Separation
• Benchmarking optimization software with performance profiles.

This page was built for publication: An alternating nonmonotone projected Barzilai-Borwein algorithm of nonnegative factorization of big matrices