On the minimal algebraic complexity of the rank-one approximation problem for general inner products - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

On the minimal algebraic complexity of the rank-one approximation problem for general inner products

Abstract

We study the algebraic complexity of Euclidean distance minimization from a generic tensor to a variety of rank-one tensors. The Euclidean Distance (ED) degree of the Segre-Veronese variety counts the number of complex critical points of this optimization problem. We regard this invariant as a function of inner products and conjecture that it achieves its minimal value at Frobenius inner product. We prove our conjecture in the case of matrices. We discuss the above optimization problem for other algebraic varieties, classifying all possible values of the ED degree. Our approach combines tools from Singularity Theory, Morse Theory, and Algebraic Geometry.

Dates and versions

hal-04408246 , version 1 (21-01-2024)

Licence

Identifiers

Cite

Khazhgali Kozhasov, Alan Muniz, Yang Qi, Luca Sodomaco. On the minimal algebraic complexity of the rank-one approximation problem for general inner products. 2024. ⟨hal-04408246⟩
30 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More