Automatic Convexity Deduction for Efficient Function’s Range Bounding

Automatic Convexity Deduction for Efficient Function’s Range Bounding

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 traditi...

Full description

Bibliographic Details
Main Authors: Mikhail Posypkin, Oleg Khamisov
Format: Article
Language:English
Published: MDPI AG 2021-01-01
Series:Mathematics
Subjects:
interval analysis
function approximation
global optimization
convexity evaluation
overestimators
underestimators
Online Access:https://www.mdpi.com/2227-7390/9/2/134

Internet

https://www.mdpi.com/2227-7390/9/2/134

Similar Items