Lower bound functions for polynomials

Journal of Computational and Applied Mathematics

Volumn 157, Issue 1, 2003, Pages 207-225

  Garloff, Jürgen ^a   Jansson, Christian ^b   Smith, Andrew P ^a  

^a UNIVERSITY OF APPLIED SCIENCES   (Germany)

^b HAMBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; ERROR ANALYSIS; FUNCTIONS; GLOBAL OPTIMIZATION; NONLINEAR SYSTEMS; PROBLEM SOLVING;

LOWER BOUND FUNCTIONS;

POLYNOMIALS;

MATHEMATICAL ANALYSIS;

EID: 0042121008     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(03)00422-9     Document Type: Article

References (30)

1. Adjiman C.S. Floudas C.A. Rigorous convex underestimators for general twice-differentiable problems J. Glob. Optim. 9 1996 23-40
2. Al-Khayyal F.A. Falk J.E. Jointly constrained biconvex programming Math. Oper. Res. 8 1983 273-286
3. Androulakis I.P. Maranas C.D. Floudas C.A. α BB: a global optimization method for general constrained nonconvex problems J. Glob. Optim. 7 4 1995 337-363
4. M. Berkelaar, LPLVE: Linear Programming Code. ftp://ftp.ics.ele.tue. nl/pub/lp_solve/.
5. Cargo G.T. Shisha O. The Bernstein form of a polynomial J. Res. Nat. Bur. Standards 70B 1966 79-81
6. Dusssel R. Schmitt B. Die Berechnung von Schranken für den Wertebereich eines polynoms in einem Intervall Computing 6 1970 35-60
7. Farin G. Curves and Surfaces for CAGD-A Practical Guide 3rd Edition 1993 Academic Press New York
8. H.C. Fisher, Range computation and applications, in: C. Ullrich (Ed.), Contributions to Computer Arithmetic and Self-Validating Numerical methods J.C. Baltzer AG, IMACS, Basel, 1990, pp. 197-211.
9. Floudas C.A. Nonlinear and Mixed-Integer Optimization 1995 Oxford University Press New York
10. Floudas C.A. Pardalos P.M. A Collection of Test Problems for Constrained Global Optimization Algorithms Lecture Notes in Computer Science Vol. 455 1990 Springer Berlin
11. Garloff J. Convergent bounds for the range of multivariate polynomials Nickel K. Interval Mathematics 1985 Lecture Notes in Computer Science Vol. 212 1986 37-56 Springer Berlin
12. J. Garloff, C. Jansson, A.P. Smith, Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion, Computing (2003) to appear.
13. Horst R. Pardalos P.M. Handbook of Global Optimization 1995 Kluwer Academic Publishers Dordrecht, Boston, London
14. Horst R. Pardalos P.M. Thoai N.V. Introduction to Global Optimization 2nd Edition 2000 Kluwer Academic Publishers Dordrecht, Boston, London
15. Jäger C. Ratz D. A combined method for enclosing all solutions of nonlinear systems of polynomial equations Reliable Comput. 1 1995 41-64
16. Jansson C. A self-validating method for solving linear programming problems with interval input data Computing 6 Suppl. 1988 33-45
17. Jansson C. Quasiconvex relaxations based on interval arithmetic Linear Algebra Appl. 324 2001 27-53
18. C. Jansson, Rigorous lower and upper bounds in linear programming, Technical Report 02.1, Forschungsschwerpunkt Informations- und Kommunikationstechnik, TU Hamburg-Harburg, 2002.
19. Lutterkort D. Peters J. Optimized refinable enclosures of multivariate polynomial pieces Comput. Aided Geom. Design 18 2002 851-863
20. Morgan A.P. Shapiro V. Box-bisection for solving second-degree systems and the problem of clustering ACM Trans. Math. Software 13 2 1987 152-167
21. Neumaier A. Interval Methods for Systems of Equations, Encyclopedia of Mathematics and its Applications 1990 Cambridge University Press Cambridge
22. Parker R.G. Radin R.L. Discrete Optimization 1988 Academic Press, Inc. New York
23. H. Ratschek, J. Rokne, Computer Methods for the Range of Functions, Halsted Press (Ellis Horwood Limited), New York (Chichester), 1984.
24. Rokne J. Bounds for an interval polynomial Computing 18 1977 225-240
25. Rokne J. Optimal computation of the Bernstein algorithm for the bound of an interval polynomial Computing 28 1982 239-246
26. Sakurai T. Sugiura H. On factorization of analytic functions and its verification Reliable Comput. 6 2000 459-470
27. Schaback R. Error estimates for approximations from control nets Comput. Aided Geom. Design 10 1993 57-66
28. V. Stahl, Interval methods for bounding the range of polynomials and solving systems of nonlinear equations, Dissertation, Johannes Kepler University Linz, Linz, Austria, 1995. ftp://ftp.risc.uni-linz. ac.at/pub/private/vstahl/thesis.ps.
29. Zamora J.M. Grossmann I.E. Continuous global optimization of structured process systems models Comput. Chem. Eng. 22 12 1998 1749-1770
30. Zettler M. Garloff J. Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion IEEE Trans. Automat. Control 43 1998 425-431