Inclusion functions and global optimization

DOI10.1007/BF01584379zbMath0579.90082OpenAlexW4236958310MaRDI QIDQ3703666

H. Ratschek

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584379

zbMATH Keywords

interval analysisglobal unconstrained optimizationsubdivision strategiesInclusion functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items

An interval version of Shubert's iterative method for the localization of the global maximum, Feature extraction algorithms for constrained global optimization. I: Mathematical foundation, Feature extraction algorithms for constrained global optimization. II: Batch process scheduling application, An algorithm for global optimization of Lipschitz continuous functions, Inclusion functions and global optimization. II, A branch-and-bound algorithm for bound constrained optimization problems without derivatives, A new interval method for locating the boundary of level sets, An interval method for bounding level sets of parameter estimation problems, Template generation for continuous transfer functions using interval analysis, What can interval analysis do for global optimization?, Convergence rates of a global optimization algorithm, Convergence qualification of adaptive partition algorithms in global optimization, The extrapolated interval global optimization algorithm, Solving nonlinear equation systems via global partition and search: Some experimental results, Nonlinear equations and optimization, The impact of accelerating tools on the interval subdivision algorithm for global optimization, The globally convexized filled functions for global optimization, An improved interval global optimization algorithm using higher-order inclusion function forms, Interval method for bounding level sets: Revisited and tested with global optimization problems, Interval tools for global optimization

Uses Software

• BRENT
• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the range of values of real functions with accuracy higher than second order
• Mean value forms in interval analysis
• Global optimization using interval analysis - the multi-dimensional case
• Die zentrische Form in der Intervallarithmetik, ihre quadratische Konvergenz und ihre Inklusionsisotonie
• Centered forms for functions in several variables
• On computing the range of values
• Automatic differentiation: techniques and applications
• On computing the range of a rational function of n variables over a bounded region
• Die Überschätzung des Wertebereichs einer Funktion in der Intervallrechnung mit Anwendungen auf lineare Gleichungssysteme
• Global optimization using interval analysis: The one-dimensional case
• The algorithmic language Triplex-ALGOL 60
• Mean Value and Taylor Forms in Interval Analysis
• Centered Forms
• Iterative Methods for the Localization of the Global Maximum
• Computation of rational interval functions
• Bernstein form of a polynomial
• Bounds on a polynomial
• Termination Criterion and Numerical Convergence
• Quadratic convergence in interval arithmetic, part II
• A Sequential Method Seeking the Global Maximum of a Function
• Quadratic convergence in interval arithmetic, part I