Factorization of completely positive matrices using iterative projected gradient steps

DOI10.1002/NLA.2391MaRDI QIDQ5033209zbMATH OpenOpenAlexWikidataFDO

Authors Radu I. Boţ, Dang-Khoa Nguyen

Publication date 22 February 2022

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/nla.2391

zbMATH Keywords

completely positive matricesmatrix factorizationnonconvex optimizationrelaxed-inertial projected gradient algorithmŁojasiewicz inequality

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical mathematical programming methods (65K05)

Recommendations

• A factorization method for completely positive matrices
• Completely positive factorization by a Riemannian smoothing method
• Factorization and cutting planes for completely positive matrices by copositive projection
• Building a completely positive factorization
• Factorization of cp-rank-3 completely positive matrices.

Cited in

(3)

• Completely positive factorization by a Riemannian smoothing method
• Tikhonov regularized iterative methods for nonlinear problems
• A projected inexact Levenberg-Marquardt method for the completely positive matrix factorization

This page was built for publication: Factorization of completely positive matrices using iterative projected gradient steps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033209)