Fast construction of constant bound functions for sparse polynomials
- 31 July 2007
- journal article
- Published by Springer Science and Business Media LLC in Journal of Global Optimization
- Vol. 43 (2-3), 445-458
- https://doi.org/10.1007/s10898-007-9195-4
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Safe and tight linear estimators for global optimizationMathematical Programming, 2004
- Global Optimization Using Interval AnalysisPublished by Taylor & Francis Ltd ,2003
- Lower bound functions for polynomialsJournal of Computational and Applied Mathematics, 2003
- Inclusion Isotonicity of Convex-Concave Extensions for Polynomials Based on Bernstein ExpansionComputing, 2003
- Deterministic Global OptimizationPublished by Springer Science and Business Media LLC ,2000
- Rigorous convex underestimators for general twice-differentiable problemsJournal of Global Optimization, 1996
- Rigorous Global Search: Continuous ProblemsPublished by Springer Science and Business Media LLC ,1996
- Algorithms for polynomials in Bernstein formComputer Aided Geometric Design, 1988
- Convergent bounds for the range of multivariate polynomialsLecture Notes in Computer Science, 1986
- Bernstein form of a polynomialJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1966