Abstract: This paper presents global computational problems related to establishing lower bounds for
highdimensional continuous functions over a simplex. We propose a rigorous approach to constructing affine
lower bounds (ALB) that remain closely beneath the original function. By extending the least squares method for
control Bernstein, we develop a convergent AB to both polynomials and rational functions. Furthermore, we
demonstrate that these bounds achieve high convergence rates to the original functions. Finally, we evaluate our
approach by comparing it with previous methods using error bound approximation.