A generalization of Takane's algorithm for DEDICOM

DOI10.1007/BF02294748MaRDI QIDQ2638682zbMATH OpenOpenAlexFDO

Authors Henk A. L. Kiers, Jos M. F. ten Berge, Yoshio Takane, Jan de Leeuw

Publication date 1990

Published in Psychometrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02294748

zbMATH Keywords

algorithmanalysis of asymmetric data matricesclosed-form solutionsfitting the DEDICOM modelleast squares fittingmajorizationmodification of Takane's algorithmmonotonic convergence

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99)

Recommendations

• A generalization of the Massey-Ding algorithm
• A generalization of the Katzman-Zhang algorithm
• scientific article; zbMATH DE number 5984
• Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
• A generalization of Gosper's algorithm
• A generic approach to decomposition algorithms, with an application to digraph decomposition
• On a generalization of the -algorithm
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• scientific article; zbMATH DE number 3874507
• An extension of Satoh's algorithm and its implementation

Cites work

• A generalization of Kristof's theorem on the trace of certain matrix products
• Best linear composites with a specified structure
• scientific article; zbMATH DE number 3734973 (Why is no real title available?)
• scientific article; zbMATH DE number 3571331 (Why is no real title available?)
• On the prehistory of Correspondence Analysis
• Solving implicit equations in psychometric data analysis

Cited in

(12)

• Constrained DEDICOM
• A generalization of GIPSCAL for the analysis of nonsymmetric data
• Weighted least squares fitting using ordinary least squares algorithms
• A generalization of the Massey-Ding algorithm
• Matrices with special reference to applications in psychometrics
• Effective algorithms for solving trace minimization problem in multivariate statistics
• Generalized GIPSCAL re-revisited: a fast convergent algorithm with acceleration by the minimal polynomial extrapolation
• A general algorithm to fit constrained DEDICOM models
• A simple general procedure for orthogonal rotation
• Model for heterogeneous random networks using continuous latent variables and an application to a tree-fungus network
• Detection of structurally homogeneous subsets in graphs
• Majorization as a tool for optimizing a class of matrix functions

This page was built for publication: A generalization of Takane's algorithm for DEDICOM

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