On the number of minima of a random polynomial

From MaRDI portal
Publication:2483199

DOI10.1016/J.JCO.2007.09.003zbMATH Open1143.65039arXivmath/0702360OpenAlexW3121892946MaRDI QIDQ2483199FDOQ2483199


Authors: Jean-Pierre Dedieu, Gregorio Malajovich Edit this on Wikidata


Publication date: 28 April 2008

Published in: Journal of Complexity (Search for Journal in Brave)

Abstract: We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain the bound O(exp(-beta n^2 + (n/2) log (d-1))) (beta is a positive constant independent on n and d) for the number of minima of such a polynomial. This proves that most normal random polynomials of fixed degree have only saddle points. Finally, we give a closed form expression for the number of maxima (resp. minima) of a random univariate polynomial, in terms of hypergeometric functions.


Full work available at URL: https://arxiv.org/abs/math/0702360




Recommendations




Cites Work


Cited In (14)





This page was built for publication: On the number of minima of a random polynomial

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