*Article* **Automatic Convexity Deduction for Efficient Function's Range Bounding**

**Mikhail Posypkin 1,\* and Oleg Khamisov <sup>2</sup>**


**Abstract:** Reliable bounding of a function's range is essential for deterministic global optimization, approximation, locating roots of nonlinear equations, and several other computational mathematics areas. Despite years of extensive research in this direction, there is still room for improvement. The traditional and compelling approach to this problem is interval analysis. We show that accounting convexity/concavity can significantly tighten the bounds computed by interval analysis. To make our approach applicable to a broad range of functions, we also develop the techniques for handling nondifferentiable composite functions. Traditional ways to ensure the convexity fail in such cases. Experimental evaluation showed the remarkable potential of the proposed methods.

**Keywords:** interval analysis; function approximation; global optimization; convexity evaluation; overestimators; underestimators
