Approximation techniques for non-linear problems with continuum of solutions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2371, Issue , 2002, Pages 224-241

  Vu, Xuan Ha ^a   Sam Haroud, Djamila ^a   Silaghi, Marius Calin ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATIONAL GEOMETRY;

APPROXIMATION TECHNIQUES; ARBITRARY ACCURACY; EXPLICIT REPRESENTATION; NONLINEAR PROBLEMS; NUMERICAL CONSTRAINT SATISFACTION PROBLEMS; OUTER APPROXIMATION; SOLUTION SET; SPLITTING STRATEGIES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84956853326     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45622-8_17     Document Type: Conference Paper

References (13)

1. Aguilera, A.: Orthogonal Polyhedra: Study and Application. PhD thesis, Universitat Polit`ecnica de Catalunya, Barcelona, Spain (1998)
2. Bournez, O., Maler, O., Pnueli, A.: Orthogonal Polyhedra: Representation and Computation. F.Vaandrager and J.Van Schuppen (Eds.), Hybrid Systems: Computation and Control, LNCS 1569 (1999) 46–60 Springer.
3. Bournez, O., Maler, O.: On the Representation of Timed Polyhedra. In: Proceedings of International Colloquium on Automata Languages and Programming (ICALP’2000), Switzerland (2000)
4. Nocedal, J., Wright, S.: Numerical Optimization - Series in Operations Research. Springer (2000)
5. Van Hentenryck, P.: A gentle introduction to Numerica. (1998)
6. ILOG: ILOG Solver. Reference Manual. (2001)
7. Jaulin, L.: Solution Globale et Guarantie de problèmes ensemblistes: application à l’estimation non linéaire et à la commande robuste. PhD thesis, Université Paris-Sud, Orsay (1994)
8. Sam-Haroud, D., Faltings, B.: Consistency techniques for continuous constraints. Constraints 1 (1996) 85–118
9. Garloff, J., Graf, B.: Solving strict polynomial inequalities by Bernstein expansion. In: Symbolic Methods in Control System Analysis and Design. (1999) 339–352
10. Benhamou, F., Goualard, F.: Universally Quantified Interval Constraints. In: Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP’2000). (2000) 67–82
11. Lhomme, O.: Consistency techniques for numeric CSPs. In: Proceedings of IJCAI’93. (1993)
12. Collavizza, H., Delobel, F., Rueher, M.: Extending consistent domains of numeric CSP. In: Proceedings IJCAI’99. (1999)
13. Silaghi, M.C., Sam-Haroud, D., Faltings, B.: Search techniques for non-linear CSPs with inequalities. In: Proceedings of the 14th Canadian Conference on AI. (2001)