Bit-complexity estimates in geometric programming, and application to the polynomial-time computation of the spectral radius of nonnegative tensors - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Bit-complexity estimates in geometric programming, and application to the polynomial-time computation of the spectral radius of nonnegative tensors

Stéphane Gaubert

Résumé

We show that the spectral radius of nonnegative tensors can be approximated within $\varepsilon$ error in polynomial time. This implies that the maximum of a nonnegative homogeneous $d$-form in the unit ball with respect to $d$-H\"older norm can be approximated in polynomial time. These results are deduced by establishing bit-size estimates for the near-minimizers of functions given by suprema of finitely many log-Laplace transforms of discrete nonnegative measures on $\mathbb{R}^n$. Hence, some known upper bounds for the clique number of hypergraphs are polynomially computable.

Dates et versions

hal-04365626 , version 1 (28-12-2023)

Licence

Paternité

Identifiants

Citer

Shmuel Friedland, Stéphane Gaubert. Bit-complexity estimates in geometric programming, and application to the polynomial-time computation of the spectral radius of nonnegative tensors. 2023. ⟨hal-04365626⟩
18 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More