A Sequential Method Seeking the Global Maximum of a Function
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Towards ``Ideal multistart. A stochastic approach for locating the minima of a continuous function inside a bounded domain
- Extended univariate algorithms for n-dimensional global optimization
- A class of filled functions for finding global minimizers of a function of several variables
- On the convergence of global methods in multiextremal optimization
- An interval version of Shubert's iterative method for the localization of the global maximum
- 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
- On computing the dispersion function
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- An interval maximum entropy method for a discrete minimax problem
- Multidimensional bisection applied to global optimisation
- On Timonov's algorithm for global optimization of univariate Lipschitz functions
- Convergence rates of a global optimization algorithm
- 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
- An application of Lipschitzian global optimization to product design
- Global optimization and polypeptide conformation
- A global minimization algorithm for a class of one-dimensional functions
- Global optimization using interval analysis: The one-dimensional case
- Interval-majorant method and global optimization
- Global optimization requires global information
- Accelerations for a variety of global optimization methods
- Accelerations for global optimization covering methods using second derivatives
- 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
- Multidimensional bisection: A dual viewpoint
- Application of Bayesian approach to numerical methods of global and stochastic optimization
- Experiments with new stochastic global optimization search techniques
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- Adaptive block coordinate DIRECT algorithm
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free 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
- A direct search algorithm for global optimization
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
- Inventory model with partial backordering when backordered customers delay purchase after stockout-restoration
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- A deterministic algorithm for global optimization
- A hybrid global optimization method: The multi-dimensional case
- An optimal algorithm for search of extrema of a bimodal function
- A hybrid global optimization method: The one-dimensional case
- Towards pure adaptive search
- A deterministic approach to global box-constrained optimization
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
- 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
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- SMGO: a set membership approach to data-driven global optimization
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Piecewise linear bounding functions in univariate global optimization
- Deterministic global derivative-free optimization of black-box problems with bounded Hessian
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Optimum departure times for commuters in congested networks
- A naive multi-scale search algorithm for global optimization problems
- Combining Bayesian optimization and Lipschitz optimization
- Multidimensional global extremum seeking via the DIRECT optimisation algorithm
- Global optimization on an interval
- Customizing methods for global optimization -- a geometric viewpoint
- A new sampling method in the DIRECT algorithm
- On the approximation of the global extremum of a semi-Lipschitz function
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Interval method for global solutions of a class of min-max-min problems
- Interpolation of Lipschitz functions
- Unified frameworks for sampled-data extremum seeking control: global optimisation and multi-unit systems
- Solving minimax problems by interval methods
- A new trisection method for solving Lipschitz bi-objective optimization problems
- Cutting angle method – a tool for constrained global optimization
- Adaptive nested optimization scheme for multidimensional global search
- A hybrid algorithm for finding a global minimum
- On the convergence of adaptive partition algorithms in global optimization
- Inclusion functions and global optimization
- Globally convergent methods for n-dimensional multiextremal optimization
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Global search perspectives for multiobjective optimization
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Exploring or reducing noise? A global optimization algorithm in the presence of noise
- Global minimization of univariate functions by sequential polynomial approximation
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- Progressive global random search of continuous functions
- Reducing transformation and global optimization
- Topics in Lipschitz global optimisation
- Geometry and combinatorics of the cutting angle method
- Generation of α‐dense curves and application to global optimization
- A deterministic algorithm for global optimization
- Adaptive Gaussian particle method for the solution of the Fokker-Planck equation
- Matrix polynomials with specified eigenvalues
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- Global non-smooth optimization in robust multivariate regression
- Optimization methods on Riemannian manifolds via extremum seeking algorithms
- Constrained, global optimization of unknown functions with Lipschitz continuous gradients
- GPU parameter tuning for tall and skinny dense linear least squares problems
- Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme
- 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
This page was built for publication: A Sequential Method Seeking the Global Maximum of a Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5664755)
