Abstract: In this paper, we propose a new low-rank matrix factorization model, dubbed bounded simplex-structured matrix factorization (BSSMF). Given an input matrix X and a factorization rank r, BSSMF ...
Abstract: Simplex-structured matrix factorization (SSMF) is a common task encountered in signal processing and machine learning. Minimum-volume constrained unmixing (MVCU) algorithms are among the ...
There are three groups of optimization techniques available in PROC NLP. A particular optimizer can be selected with the TECH=name option in the PROC NLP statement. Since no single optimization ...
This is a preview. Log in through your library . Abstract A computational procedure based on the results of Barankin and Dorfman [1], for minimising a convex quadratic function subject to linear ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results