ε-Algorithm Accelerated Fixed-Point Iteration for the Three-Way GIPSCAL Problem in Asymmetric MDS

The Generalized Inner Product SCALing (GIPSCAL) model is a specialized tool for analyzing square asymmetric tables within asymmetric multidimensional scaling (MDS), with applications in sociology (e.g., social mobility tables) and marketing (e.g., brand switching data). This paper presents the development of an efficient numerical algorithm for solving the three-way GIPSCAL problem. We focus on vector ε-algorithm-accelerated fixed-point iterations, detailing the underlying acceleration principles. Extensive numerical experiments show that the proposed method achieves acceleration performance comparable to polynomial extrapolation and Anderson acceleration. Furthermore, compared to continuous-time projected gradient flow methods and first- and second-order Riemannian optimization algorithms from the Manopt toolbox, our approach demonstrates superior computational efficiency and scalability.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-08-20
DOI
https://doi.org/10.3390/math13162680
Primary Topic
Matrix Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ε-Algorithm Accelerated Fixed-Point Iteration for the Three-Way GIPSCAL Problem in Asymmetric MDS

Jiao‐fen Li, Mao Chen, Y. Qin
Mathematics
Matrix Theory and Algorithms
article

ε-Algorithm Accelerated Fixed-Point Iteration for the Three-Way GIPSCAL Problem in Asymmetric MDS

Jiao‐fen Li, Mao Chen, Y. Qin
article en

Abstract

The Generalized Inner Product SCALing (GIPSCAL) model is a specialized tool for analyzing square asymmetric tables within asymmetric multidimensional scaling (MDS), with applications in sociology (e.g., social mobility tables) and marketing (e.g., brand switching data). This paper presents the development of an efficient numerical algorithm for solving the three-way GIPSCAL problem. We focus on vector ε-algorithm-accelerated fixed-point iterations, detailing the underlying acceleration principles. Extensive numerical experiments show that the proposed method achieves acceleration performance comparable to polynomial extrapolation and Anderson acceleration. Furthermore, compared to continuous-time projected gradient flow methods and first- and second-order Riemannian optimization algorithms from the Manopt toolbox, our approach demonstrates superior computational efficiency and scalability.

MathematicsVol. 13(16)
Guilin University of Electronic Technology (CN)
National Natural Science Foundation of China, Guilin University of Electronic Technology
Openalex Percentile: Top 77%
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.