@inproceedings{ara-tro-nev-12-aa-convtay,
  author = {Araya, Ignacio and Trombettoni, Gilles and Neveu, Bertrand},
  title = {A Contractor based on Convex Interval {Taylor}},
  booktitle = {Proceedings of the International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR)},
  year = 2012,
  month = may,
  location = {Nantes, FR},
  pages = {1–16},
  series = {Lecture Notes in Computer Science},
  volume = {7298},
  isbn = {978-3-642-29827-1},
  doi = {10.1007/978-3-642-29828-8_1},
  comment = {Alternative to AA, compares with AA},
  abstract = {nterval Taylor has been proposed in the sixties by the interval analysis community for relaxing continuous non-convex constraint systems. However, it generally produces a non-convex relaxation of the solution set. A simple way to build a convex polyhedral relaxation is to select a corner of the studied domain/box as expansion point of the interval Taylor form, instead of the usual midpoint. The idea has been proposed by Neumaier to produce a sharp range of a single function and by Lin and Stadtherr to handle n ×n (square) systems of equations. This paper presents an interval Newton-like operator, called X-Newton, that iteratively calls this interval convexification based on an endpoint interval Taylor. This general-purpose contractor uses no preconditioning and can handle any system of equality and inequality constraints. It uses Hansen’s variant to compute the interval Taylor form and uses two opposite corners of the domain for every constraint. The X-Newton operator can be rapidly encoded, and produces good speedups in constrained global optimization and constraint satisfaction. First experiments compare X-Newton with affine arithmetic.}
}