A Sequential Method Seeking the Global Maximum of a Function

DOI10.1137/0709036zbMath0251.65052OpenAlexW2026299065MaRDI QIDQ5664755

Bruno O. Shubert

Publication date: 1972

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Algorithms in computer science (68W99)

Related Items (only showing first 100 items - show all)

Application of Bayesian approach to numerical methods of global and stochastic optimization ⋮ A class of filled functions for finding global minimizers of a function of several variables ⋮ Global optimization on an interval ⋮ On the convergence of global methods in multiextremal optimization ⋮ Cutting angle method – a tool for constrained global optimization ⋮ An interval version of Shubert's iterative method for the localization of the global maximum ⋮ Inclusion functions and global optimization ⋮ Adaptive global optimization based on a block-recursive dimensionality reduction scheme ⋮ Customizing methods for global optimization -- a geometric viewpoint ⋮ A new sampling method in the DIRECT algorithm ⋮ An algorithm for global optimization of Lipschitz continuous functions ⋮ Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization ⋮ Unified frameworks for sampled-data extremum seeking control: global optimisation and multi-unit systems ⋮ On computing the dispersion function ⋮ Solving minimax problems by interval methods ⋮ Globally convergent methods for n-dimensional multiextremal optimization ⋮ Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions ⋮ Adaptive nested optimization scheme for multidimensional global search ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ Piecewise linear bounding functions in univariate global optimization ⋮ On the approximation of the global extremum of a semi-Lipschitz function ⋮ Towards pure adaptive search ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ Challenges of continuous global optimization in molecular structure prediction ⋮ Global search perspectives for multiobjective optimization ⋮ An interval maximum entropy method for a discrete minimax problem ⋮ A new trisection method for solving Lipschitz bi-objective optimization problems ⋮ Exploring or reducing noise? A global optimization algorithm in the presence of noise ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ Deterministic global derivative-free optimization of black-box problems with bounded Hessian ⋮ On the convergence of adaptive partition algorithms in global optimization ⋮ Adaptive block coordinate DIRECT algorithm ⋮ Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization ⋮ Study of multiscale global optimization based on parameter space partition ⋮ Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization ⋮ MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys. A DIRECT-inspired optimization algorithm for experimentally accessible computational material design ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ A deterministic approach to global box-constrained optimization ⋮ Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems ⋮ Reducing transformation and global optimization ⋮ Concurrent stochastic methods for global optimization ⋮ A filled function method for finding a global minimizer of a function of several variables ⋮ Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives ⋮ Matrix polynomials with specified eigenvalues ⋮ Multidimensional bisection applied to global optimisation ⋮ A one-step worst-case optimal algorithm for bi-objective univariate optimization ⋮ On Timonov's algorithm for global optimization of univariate Lipschitz functions ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ A direct search algorithm for global optimization ⋮ Convergence rates of a global optimization algorithm ⋮ A hybrid algorithm for finding a global minimum ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Optimal switching between cash-flow streams ⋮ 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 ⋮ An application of Lipschitzian global optimization to product design ⋮ An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section ⋮ Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ Interval method for global solutions of a class of min-max-min problems ⋮ Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity ⋮ Global optimization and polypeptide conformation ⋮ Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties ⋮ On the extension of the \textsc{direct} algorithm to multiple objectives ⋮ The DIRECT algorithm: 25 years later ⋮ Interpolation of Lipschitz functions ⋮ Optimum departure times for commuters in congested networks ⋮ Solving nonlinear equation systems via global partition and search: Some experimental results ⋮ A naive multi-scale search algorithm for global optimization problems ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints ⋮ A global minimization algorithm for a class of one-dimensional functions ⋮ Inventory model with partial backordering when backordered customers delay purchase after stockout-restoration ⋮ Global optimization using interval analysis: The one-dimensional case ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} ⋮ A deterministic algorithm for global optimization ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ Interval-majorant method and global optimization ⋮ Global optimization requires global information ⋮ Combining Bayesian optimization and Lipschitz optimization ⋮ A hybrid global optimization method: The multi-dimensional case ⋮ SMGO: a set membership approach to data-driven global optimization ⋮ An optimal algorithm for search of extrema of a bimodal function ⋮ Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain ⋮ Experiments with new stochastic global optimization search techniques ⋮ Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization ⋮ Extended univariate algorithms for \(n\)-dimensional global optimization ⋮ A hybrid global optimization method: The one-dimensional case ⋮ Accelerations for a variety of global optimization methods ⋮ Accelerations for global optimization covering methods using second derivatives ⋮ Set partition by globally optimized cluster seed points ⋮ Lipschitzian optimization without the Lipschitz constant ⋮ Cord-slope form of Taylor's expansion in univariate global optimization ⋮ A parallel method for finding the global minimum of univariate functions ⋮ An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems ⋮ Multidimensional bisection: A dual viewpoint ⋮ Multidimensional global extremum seeking via the DIRECT optimisation algorithm

This page was built for publication: A Sequential Method Seeking the Global Maximum of a Function