Numerical solution for bounding feasible point sets

Journal of Computational and Applied Mathematics

Volumn 156, Issue 1, 2003, Pages 201-219

  Xu, Peiliang ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Feasible point set; Interval mathematics; Multisection; Multisplitting

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GLOBAL OPTIMIZATION; MATHEMATICAL MODELS;

FEASIBLE POINT SETS;

SET THEORY;

MATHEMATICAL ANALYSIS; OPTIMIZATION;

EID: 0037532884     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(02)00912-3     Document Type: Article

References (34)

1. Bertsekas D.P. Constrained Optimization and Lagrange Multiplier Methods 1982 Academic Press New York
2. Burke J. Han S.-P. A Gauss-Newton approach to solving generalized inequalities Math. Oper. Res. 11 1986 632-643
3. Casado L.G. García I. Csendes T. A new multisection technique in interval methods for global optimization Computing 65 2000 263-269
4. Csallner A. Csendes T. Markót M. Multisection in interval branch-and-bound methods for global optimization I: theoretical results J. Global Optim. 16 2000 371-392
5. Daniel J.W. Newton's method for nonlinear inequalities Numer. Math. 21 1973 381-387
6. Dennis J.E. El-Alem M. Williamson K. A trust-region approach to nonlinear systems of equalities and inequalities SIAM J. Optim. 9 1999 291-315
7. Floudas C.A. Deterministic Global Optimization: Theory, Methods and Applications 2000 Kluwer Academic Dordrecht
8. Hansen E. Global optimization using interval analysis: the multi-dimensional case Numer. Math. 34 1980 247-270
9. Hansen E. Global Optimization Using Interval Analysis 1992 Marcel Dekker New York
10. Hansen E. Sengupta S. Global constrained optimization using interval analysis Nickel K.L. Interval Mathematics 1980 25 47 Academic Press New York
11. Herman G.T. Tuy H.K. Image reconstruction from projections: an approach from mathematical analysis Sabatier P.C. Basic Methods of Tomography and Inverse Problems 1987 1 124 Adam Hilger Bristol
12. Hong H. Heuristic search and pruning in polynomial constraints satisfaction Ann. Math. Artif. Intellig. 19 1997 319-334
13. Hong H. Stahl V. Safe starting regions by fixed points and tightening Computing 53 1994 323-335
14. Horst R. Pardalos P.M. Thoai N.V. Introduction to Global Optimization 2nd Edition 2000 Kluwer Academic Publishers Dordrecht
15. Horst R. Tuy H. Global Optimization: Deterministic Approaches 3rd Edition 1996 Springer Berlin
16. Jaulin L. Interval constraint propagation with application to bounded-error estimation Automatica 36 2000 1547-1552
17. Jaulin L. Kieffer M. Didrit O. Walter É. Applied Interval Analysis 2001 Springer London
18. Kearfott R.B. Rigorous Global Search: Continuous Problems 1996 Kluwer Academic Dordrecht
19. Kearfott R.B. A review of techniques in the verified solution of constrained global optimization problems Kearfott R.B. Kreinovich V. Applications of Interval Computations 1996 23 60 Kluwer Academic Publishers Dordrecht
20. Kearfott R.B. On proving existence of feasible points in equality constrained optimization problems Math. Prog. 83 1998 89-100
21. Kristinsdottir B.P. Zabinsky Z.B. Csendes T. Tuttle M.E. Methodologies for tolerance intervals Interval Comput. 3 1993 133-147
22. Metropolis N. Rosenbluth A. Rosenbluth M. Teller A. Teller E. Equation of state calculations by fast computing machines J. Chem. Phys. 21 1953 1087-1092
23. Moore R.E. Interval Analysis 1966 Prentice-Hall Englewood Cliffs, NJ
24. Neumaier A. The enclosure of solutions of parameter-dependent systems of equations Moore R.E. Reliability in Computing 1988 269-286 Academic Press London
25. Neumaier A. Interval Methods for Systems of Equations 1990 Cambridge University Press Cambridge
26. Polyak B.T. Gradient methods for solving equations and inequalities USSR Comput. Math. Math. Phys. 4 1964 17-32
27. Pshenichnyi B.N. Newton's method for the solution of systems of equalities and inequalities Math. Notes Acad. Sci. USSR 8 1970 827-830
28. Ratschek H. Rokne J. New Computer Methods for Global Optimization 1988 Ellis Horwood Chichester
29. Robinson S.M. Extension of Newton's method to nonlinear functions with values in a cone Numer. Math. 19 1972 341-347
30. Tikhonov A.N. Arsenin V.Y. Solutions of Ill-posed Problem 1977 Wiley New York
31. Tuy H. Convex Analysis and Global Optimization 1998 Kluwer Academic Publishers Dordrecht
32. van Hentenryck P. Mcallester D. Kapur D. Solving polynomial systems using a branch and prune approach SIAM J. Numer. Anal. 34 1997 797-827
33. Wolfe M.A. An interval algorithm for constrained global optimization J. Comput. Appl. Math. 50 1994 605-612
34. Xu P.L. A hybrid global optimization method: the one-dimensional case J. Comput. Appl. Math. 147 2002 301-314