An interval version of Shubert's iterative method for the localization of the global maximum
From MaRDI portal
Publication:1082042
DOI10.1007/BF02240102zbMath0602.65040MaRDI QIDQ1082042
Publication date: 1987
Published in: Computing (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)
Related Items
An interval maximum entropy method for a discrete minimax problem, Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems, Unconstrained and constrained global optimization of polynomial functions in one variable, Convergence qualification of adaptive partition algorithms in global optimization, Global optimization of univariate Lipschitz functions. I: Survey and properties, Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison, Interval method for global solutions of a class of min-max-min problems, New filled functions for nonsmooth global optimization, A one-parameter filled function for nonsmooth global optimization and its application, Interval-majorant method and global optimization, Cord-slope form of Taylor's expansion in univariate global optimization
Cites Work
- Global optimization using interval analysis - the multi-dimensional case
- On computing the range of values
- Global optimization using interval analysis: The one-dimensional case
- Inclusion functions and global optimization
- Iterative Methods for the Localization of the Global Maximum
- A Sequential Method Seeking the Global Maximum of a Function
