Lower Bounds for Polynomials with Simplex Newton Polytopes Based on Geometric Programming.
Sadik IlimanTimo de WolffPublished in: SIAM J. Optim. (2016)
Keyphrases
- lower bound
- upper bound
- objective function
- programming language
- branch and bound algorithm
- algebraic curves
- branch and bound
- optimal solution
- lower and upper bounds
- linear programming
- convex hull
- worst case
- geometric structure
- vc dimension
- computer programming
- programming environment
- np hard
- lattice points
- dynamic programming
- upper and lower bounds
- lagrange interpolation
- simplex algorithm
- online algorithms
- linear programming relaxation
- geometric constraints
- least squares
- sample size