Article thumbnail

Guaranteed Global Deterministic Optimization and Constraint Programming for Complex Dynamic Problems

By Hugo Joudrier and Khaled Hadj-Hamou

Abstract

International audienceIn this article we focus on particular multi-physics (mechanic, magnetic, electronic...) dynamic problems. These problems contain some differential constraints to model dynamic behaviors. The goal is to be able to solve it with guarantee, meaning to get a proof that all constraints are satisfied (without any approximation caused by binary representations or rounding modes from the unit core computing). The idea of getting guarantees on the arithmetic operations has been introduced via Interval Arithmetic. Computers become faster gradually, increasing the rate of operations number computable in one time unit. The results computed are often rounded to the nearest representable values, then the global errors are increasing gradually as well without any control over it

Topics: Constraint Programming, Tube Arithmetic, Interval Arithmetic, Ordinary Differential Equation, Global Optimization, [INFO.INFO-NA]Computer Science [cs]/Numerical Analysis [cs.NA], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]
Publisher: HAL CCSD
Year: 2015
OAI identifier: oai:HAL:hal-01244426v2
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles