Formalization of Bernstein Polynomials and Applications to Global Optimization
- 18 July 2012
- journal article
- research article
- Published by Springer Science and Business Media LLC in Journal of Automated Reasoning
- Vol. 51 (2), 151-196
- https://doi.org/10.1007/s10817-012-9256-3
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Uncertainty analysis via failure domain characterizationPublished by Taylor & Francis Ltd ,2011
- MetiTarski: An Automatic Theorem Prover for Real-Valued Special FunctionsJournal of Automated Reasoning, 2009
- Combined Decision Techniques for the Existential Theory of the RealsLecture Notes in Computer Science, 2009
- An efficient algorithm for range computation of polynomials using the Bernstein formJournal of Global Optimization, 2008
- A new subdivision algorithm for the Bernstein polynomial approach to global optimizationInternational Journal of Automation and Computing, 2007
- Fast construction of constant bound functions for sparse polynomialsJournal of Global Optimization, 2007
- Implementing the cylindrical algebraic decomposition within the Coq systemMathematical Structures in Computer Science, 2007
- Algorithm 852ACM Transactions on Mathematical Software, 2006
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- A review of conflict detection and resolution modeling methodsIEEE Transactions on Intelligent Transportation Systems, 2000