Iterative Methods for the Localization of the Global Maximum

From MaRDI portal
Publication:3942321

DOI10.1137/0719054zbMath0483.65038OpenAlexW2031449131MaRDI QIDQ3942321

Patricio Basso

Publication date: 1982

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0719054



Related Items

An interval version of Shubert's iterative method for the localization of the global maximum, Inclusion functions and global optimization, The modified upwind finite difference fractional step method for compressible two-phase displacement problem, Inclusion functions and global optimization. II, Towards pure adaptive search, Global optimization of Hölder functions, An interval maximum entropy method for a discrete minimax problem, Study of multiscale global optimization based on parameter space partition, A filled function method with one parameter for unconstrained global optimization, A new filled function applied to global optimization., Multidimensional bisection applied to global optimisation, A new filled function method with two parameters for global optimization, A global minimization algorithm for Lipschitz functions, A new global optimization method for univariate constrained twice-differentiable NLP problems, 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, The bisection method in higher dimensions, Multidimensional bisection: the performance and the context, Global minimization of univariate functions by sequential polynomial approximation, A new filled function for unconstrained global optimization, Upwind finite difference method for miscible oil and water displacement problem with moving boundary values, A filled function method for global optimization with inequality constraints, Interval-majorant method and global optimization, A hybrid global optimization method: The multi-dimensional case, A filled function which has the same local minimizer of the objective function, Several filled functions with mitigators., A hybrid global optimization method: The one-dimensional case