Automatic Convexity Deduction for Efficient Function’s Range Bounding
Open Access
- 10 January 2021
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 9 (2) , 134
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
Funding Information
- Ministry of Science and Higher Education of the Russian Federation (075-15-2020-799)
This publication has 34 references indexed in Scilit:
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in roboticsApplied Mathematics and Computation, 2021
- Connecting optimization with spectral analysis of tri-diagonal matricesMathematical Programming, 2020
- GOSH: derivative-free global optimization using multi-dimensional space-filling curvesJournal of Global Optimization, 2017
- Tuning fuzzy power-system stabilizers in multi-machine systems by global optimization algorithms based on efficient domain partitionsElectric Power Systems Research, 2008
- On the modeling of PWM converters for large signal analysis in discontinuous conduction modeIEEE Transactions on Power Electronics, 1994
- Lipschitzian optimization without the Lipschitz constantJournal of Optimization Theory and Applications, 1993
- Time-domain analysis of networks with internally controlled switchesIEEE Transactions on Circuits and Systems I: Regular Papers, 1992
- Extended univariate algorithms for n-dimensional global optimizationComputing, 1986
- A Sequential Method Seeking the Global Maximum of a FunctionSIAM Journal on Numerical Analysis, 1972
- Numerical methods for finding global extrema (Case of a non-uniform mesh)USSR Computational Mathematics and Mathematical Physics, 1971