Finding explicit solutions for linear regression without correspondences based on rearrangement inequality

DOI10.14317/JAMI.2024.149MaRDI QIDQ6567341zbMATH OpenFDO

Authors Mijin Kim, Hyungu Lee, Hayoung Choi

Publication date 4 July 2024

Published in Journal of Applied Mathematics \& Informatics (Search for Journal in Brave)

zbMATH Keywords

least squaresrearrangement inequalityoptimizatoinpermuted linear modelshuffled regression

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Nonconvex programming, global optimization (90C26) Problems with incomplete information (optimization) (49N30)

Recommendations

• Solution of a statistical optimization problem by rearrangement methods
• Applications of rearrangements to nonlinear optimization problems
• Convex solution of a permutation problem
• On the extrema of linear least-squares problems
• Robust least squares solution of linear inequalities

Cites work

• scientific article; zbMATH DE number 996055 (Why is no real title available?)
• scientific article; zbMATH DE number 3073200 (Why is no real title available?)
• 10.1162/1532443041827907
• An Algebraic-Geometric Approach for Linear Regression Without Correspondences
• Efficient Estimation of a System of Regression Equations when Disturbances are Both Serially and Contemporaneously Correlated
• Fuzzy linear regression and its applications to forecasting in uncertain environment
• Generalized Rearrangement Inequalities
• Homomorphic sensing of subspace arrangements
• Introduction to linear regression analysis
• Least squares data fitting with applications
• Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery
• Unlabeled Sensing With Random Linear Measurements

This page was built for publication: Finding explicit solutions for linear regression without correspondences based on rearrangement inequality

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