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)
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
65G30: Interval and finite arithmetic
Related Items
A one-parameter filled function for nonsmooth global optimization and its application, New filled functions for nonsmooth global optimization, An interval maximum entropy method for a discrete minimax problem, 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-majorant method and global optimization, Cord-slope form of Taylor's expansion in univariate global optimization, Interval adjustable entropy algorithm for a class of unconstrained discrete minimax problems, Interval method for global solutions of a class of min-max-min problems
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
