Papers › Algebraic degree of optimization over a variety with an application to p-norm distance degree
Algebraic degree of optimization over a variety with an application to p-norm distance degree
Kaie Kubjas, Olga Kuznetsova, Luca Sodomaco
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study an optimization problem with the feasible set being a real algebraic variety X and whose parametric objective function fᵤ is gradient-solvable with respect to the parametric data u. This class of problems includes Euclidean distance optimization as well as maximum likelihood optimization. For these particular optimization problems, a prominent role is played by the ED and ML correspondence, respectively. To our generalized optimization problem we attach an optimization correspondence and show that it is equidimensional. This leads to the notion of algebraic degree of optimization on X. We apply these results to p-norm optimization, and define the p-norm distance degree of X, which coincides with the ED degree of X for p=2. Finally, we derive a formula for the p-norm distance degree of X as a weighted sum of the polar classes of X under suitable transversality conditions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections