Relaxation methods for constrained matrix factorization problems: solving the phase mapping problem in materials discovery

DOI10.1007/978-3-319-59776-8_9MaRDI QIDQ2011581zbMATH OpenOpenAlexFDO

Authors Junwen Bai, Johan Bjorck, Yexiang Xue, Santosh K. Suram, John Gregoire, Carla P. Gomes

Publication date 4 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-59776-8_9

zbMATH Keywords

constrained matrix factorizationmultiplicative updatesphase mappingrelaxation methods

Mathematics Subject Classification ID

Factorization of matrices (15A23) Computational aspects of data analysis and big data (68T09) Pattern recognition, speech recognition (68T10)

Recommendations

• An efficient relaxed projection method for constrained non-negative matrix factorization with application to the phase-mapping problem in materials science
• Matrix factorization for evolution data
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Matrix product constraints by projection methods
• A survey on deep matrix factorizations

Cites work

• Learning the parts of objects by non-negative matrix factorization
• On the complexity of nonnegative matrix factorization
• Two algorithms for constructing a Delaunay triangulation

Cited in

(2)

• An efficient relaxed projection method for constrained non-negative matrix factorization with application to the phase-mapping problem in materials science
• Relaxing high-dimensional constraints in the direct solution space method for early phase development

This page was built for publication: Relaxation methods for constrained matrix factorization problems: solving the phase mapping problem in materials discovery

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