A Sequential Method Seeking the Global Maximum of a Function
From MaRDI portal
Cited in
(only showing first 100 items - show all)- SMGO: a set membership approach to data-driven global optimization
- On the approximation of the global extremum of a semi-Lipschitz function
- Customizing methods for global optimization -- a geometric viewpoint
- GPU parameter tuning for tall and skinny dense linear least squares problems
- Interval method for global solutions of a class of min-max-min problems
- Challenges of continuous global optimization in molecular structure prediction
- Deterministic global derivative-free optimization of black-box problems with bounded Hessian
- Constrained, global optimization of unknown functions with Lipschitz continuous gradients
- A parallel method for finding the global minimum of univariate functions
- A filled function method for finding a global minimizer of a function of several variables
- An algorithm for global optimization of Lipschitz continuous functions
- Inclusion functions and global optimization
- A hybrid global optimization method: The multi-dimensional case
- A deterministic algorithm for global optimization
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- An application of Lipschitzian global optimization to product design
- Global search perspectives for multiobjective optimization
- Exploring or reducing noise? A global optimization algorithm in the presence of noise
- Set partition by globally optimized cluster seed points
- Necessary and sufficient conditions for robust minimal solutions in uncertain vector optimization
- Accelerations for global optimization covering methods using second derivatives
- Global optimization and polypeptide conformation
- (Global) optimization: historical notes and recent developments
- 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
- Continuous global optimization of multivariable functions based on Sergeev and Kvasov diagonal approach
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- A deterministic approach to global box-constrained optimization
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Multidimensional bisection: the performance and the context
- Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
- Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach
- Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Solving infinite horizon optimization problems through analysis of a one-dimensional global optimization problem
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
- Global optimization method with numerically calculated function derivatives
- Multidimensional bisection applied to global optimisation
- Efficient constitutive parameter identification through optimisation-based techniques: a comparative analysis and novel composite Bayesian optimisation strategy
- Optimum departure times for commuters in congested networks
- Optimal switching between cash-flow streams
- Adaptive global optimization based on a block-recursive dimensionality reduction scheme
- A global minimization algorithm for a class of one-dimensional functions
- Global optimization using interval analysis: The one-dimensional case
- On computing the dispersion function
- A naive multi-scale search algorithm for global optimization problems
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- Piecewise linear bounding functions in univariate global optimization
- On the convergence of global methods in multiextremal optimization
- Multiobjective optimization by using cutting angle methods and hypervolume criterion
- A new trisection method for solving Lipschitz bi-objective optimization problems
- Convergence rates of a global optimization algorithm
- Generation of α‐dense curves and application to global optimization
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- On the convergence of adaptive partition algorithms in global optimization
- Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Optimization methods on Riemannian manifolds via extremum seeking algorithms
- POINTWISE CONSTRUCTION OF LIPSCHITZ AGGREGATION OPERATORS WITH SPECIFIC PROPERTIES
- Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity
- Lipschitzian optimization without the Lipschitz constant
- An interval version of Shubert's iterative method for the localization of the global maximum
- Global minimization of univariate functions by sequential polynomial approximation
- Adaptive Gaussian particle method for the solution of the Fokker-Planck equation
- Cutting angle method – a tool for constrained global optimization
- Combining Bayesian optimization and Lipschitz optimization
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Reducing transformation and global optimization
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
- Interval-majorant method and global optimization
- Solving nonlinear equation systems via global partition and search: Some experimental results
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- A hybrid algorithm for finding a global minimum
- On the extension of the \textsc{direct} algorithm to multiple objectives
- The DIRECT algorithm: 25 years later
- The bisection method in higher dimensions
- On Hölder global optimization method using piecewise affine bounding functions
- Global optimization: the Alienor mixed method with Piyavskii‐Shubert technique
- An optimal algorithm for search of extrema of a bimodal function
- 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 rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Cord-slope form of Taylor's expansion in univariate global optimization
- Convergence qualification of adaptive partition algorithms in global optimization
- Accelerations for a variety of global optimization methods
- Global optimization: A new variant of the Alienor method
- A direct search algorithm for global optimization
- A new sampling method in the DIRECT algorithm
- Topics in Lipschitz global optimisation
- Extended univariate algorithms for n-dimensional global optimization
- Concurrent stochastic methods for global optimization
- Global optimization on an interval
- Multidimensional Global Search Using Numerical Estimations of Minimized Function Derivatives and Adaptive Nested Optimization Scheme
- An interval maximum entropy method for a discrete minimax problem
- An efficient global optimization algorithm with adaptive estimates of the local Lipschitz constants
- The Alienor method coupled to the Brent algorithm
- Solving minimax problems by interval methods
- Efficient global optimization of multivariate functions with unknown Hölder constants via -dense curves
- Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization
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)
