• Journal of applied mathematics & informatics
• /
• v.42 no.1
• /
• pp.149-158
• /
• 2024

A least squares problem without correspondences is expressed as the following optimization: Π∈P^min_{m, x∈ℝn} ║Ax-Πy║, where A ∈ ℝ^m×n and y ∈ ℝ^m are given. In general, solving such an optimization problem is highly challenging. In this paper we use the rearrangement inequalities to find the closed form of solutions for certain cases. Moreover, despite the stringent constraints, we successfully tackle the nonlinear least squares problem without correspondences by leveraging rearrangement inequalities.