<b>A RESTRAINED CONDITION NUMBER LEAST SQUARES TECHNIQUE WITH ITS APPLICATIONS TO AVOIDING </b><b>RANK DEFICIENCY </b>

DOI Web Site 1 Citations 16 References

Bibliographic Information

Other Title
  • <b>A RESTRAINED CONDITION NUMBER LEAST SQUARES TECHNIQUE WITH ITS APPLICATIONS TO AVOIDING </b><b>RANK DEFICIENCY</b>
  • A RESTRAINED CONDITION NUMBER LEAST SQUARES TECHNIQUE WITH ITS APPLICATIONS TO AVOIDING RANK DEFICIENCY

Search this article

Abstract

ABSTRACT An algorithm for the constrained least squares problem is proposed in which the upper bound of the condition number of a parameter matrix is predetermined. Inthe algorithm, the parameter matrix to be obtained is reparameterized using its sin gular value decomposition, and the loss function is minimized alternately over the singular vector matrices and the singular values with condition number constraint. It was demonstrated that the algorithm recovered full rank matrices in simulated reverse component analysis, in which the matrices were estimated from their reduced rank counterparts. The proposed algorithm is useful for avoiding degenerate solutions in which parameter matrices become rank decient, which is illustrated in its application to generalized oblique Procrustes rotation and three-mode Parafac component analysis.

Journal

Citations (1)*help

See more

References(16)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top