Iterative Methods for the Localization of the Global Maximum

DOI10.1137/0719054MaRDI QIDQ3942321zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Gauss-Seidel methodJacobi methoditerative and relaxation methodsmaximum of a real-valued functionmethods of chaotic type

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cited in

(29)

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

This page was built for publication: Iterative Methods for the Localization of the Global Maximum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3942321)