Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization

DOI10.1007/s10589-012-9507-6zbMath1291.90244OpenAlexW1991604019MaRDI QIDQ354621

Hong-Wei Liu, Xiang-Li Li

Publication date: 19 July 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-012-9507-6

zbMATH Keywords

alternating least squaresnon-negative matrix factorizationactive setsnon-monotone technique

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (max. 100)

An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization ⋮ Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing ⋮ Efficient algorithms for solving condition number-constrained matrix minimization problems ⋮ A class of modified FR conjugate gradient method and applications to non-negative matrix factorization

Cites Work

• Unnamed Item
• Unnamed Item
• New adaptive stepsize selections in gradient methods
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
• Modified two-point stepsize gradient methods for unconstrained optimization
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• On the asymptotic behaviour of some new gradient methods
• Document clustering using nonnegative matrix factorization
• R-linear convergence of the Barzilai and Borwein gradient method
• Two-Metric Projection Methods for Constrained Optimization
• Two-Point Step Size Gradient Methods
• Introducing a weighted non-negative matrix factorization for image classification
• Evaluation of distance metrics for recognition based on non-negative matrix factorization
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization

This page was built for publication: Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization