Intrinsic complexity estimates in polynomial optimization

Abstract : It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of variables and constraints and $d$ is the maximal degree of the polynomials involved.\spar \noindent We associate to each of these problems an intrinsic system degree which becomes in worst case of order $(n\,d)^{O(n)}$ and which measures the intrinsic complexity of the task under consideration.\spar \noindent We design non-uniformly deterministic or uniformly probabilistic algorithms of intrinsic, quasi-polynomial complexity which solve these problems.
Document type :
Journal articles
Complete list of metadatas

Cited literature [47 references]  Display  Hide  Download

https://hal.inria.fr/hal-00815123
Contributor : Mohab Safey El Din <>
Submitted on : Monday, February 10, 2014 - 5:39:28 PM
Last modification on : Friday, August 2, 2019 - 3:06:02 PM
Long-term archiving on : Sunday, May 11, 2014 - 7:35:10 AM

Files

opt_27_01_14.pdf
Files produced by the author(s)

Identifiers

Citation

Bernd Bank, Marc Giusti, Joos Heintz, Mohab Safey El Din. Intrinsic complexity estimates in polynomial optimization. Journal of Complexity, Elsevier, 2014, 30 (4), pp.430-443. ⟨10.1016/j.jco.2014.02.005⟩. ⟨hal-00815123v2⟩

Share

Metrics

Record views

554

Files downloads

1233