Simplicial global optimization
From MaRDI portal
Publication:2851341
Recommendations
- Simplicial Lipschitz optimization without the Lipschitz constant
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Deterministic global optimization. Geometric branch-and-bound methods and their applications
- A new simplicial cover technique in constrained global optimization
Cited in
(73)- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
- Globally-biased disimpl algorithm for expensive global optimization
- Global optimization method with numerically calculated function derivatives
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants
- Computing an upper bound on contact stress with surrogate duality
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- Visualization of a statistical approximation of the Pareto front
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- A Search Algorithm for the Global Extremum of a Discontinuous Function
- A method for searching for a globally optimal \(k\)-partition of higher-dimensional datasets
- Rounding on the standard simplex: regular grids for global optimization
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- scientific article; zbMATH DE number 970358 (Why is no real title available?)
- Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
- On the least-squares fitting of data by sinusoids
- On refinement of the unit simplex using regular simplices
- On deterministic diagonal methods for solving global optimization problems with Lipschitz gradients
- A \textsc{direct}-type global optimization algorithm for image registration
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem
- 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
- Survey of piecewise convex maximization and PCMP over spherical sets
- A hybrid of Bayesian-based global search with Hooke-Jeeves local refinement for multi-objective optimization problems
- An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria
- A direct search algorithm for global optimization
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes
- The simplex method as a global optimizer: A C-programming perspective
- On the exhaustivity of simplicial partitioning
- Approximating a solution set of nonlinear inequalities
- An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework
- Numerical methods using two different approximations of space-filling curves for black-box global optimization
- Mathematically Rigorous Global Optimization and Fuzzy Optimization
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms
- Granular sieving algorithm for selecting best n$$ n $$ parameters
- Generalized parallel computational schemes for time-consuming global optimization
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
- A Partition Based Bayesian Multi-objective Optimization Algorithm
- Multidimensional global optimization using numerical estimates of objective function derivatives
- The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm.
- ON THE ACCURACY OF SOME ABSORBING BOUNDARY CONDITIONS FOR THE SCHRODINGER EQUATION
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- MSO: a framework for bound-constrained black-box global optimization algorithms
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- Efficient multicriterial optimization based on intensive reuse of search information
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- On dealing with minima at the border of a simplicial feasible area in simplicial branch and bound
- Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- On convergence rate of a rectangular partition based global optimization algorithm
- A deterministic global optimization using smooth diagonal auxiliary functions
- On parallel branch and bound frameworks for global optimization
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
- Hyperparameter autotuning of programs with HybridTuner
- (Global) optimization: historical notes and recent developments
- Hybrid simplicial-randomized approximate stochastic dynamic programming for multireservoir optimization
- Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
- A simplicial homology algorithm for Lipschitz optimisation
- A hybrid of Bayesian approach based global search with clustering aided local refinement
This page was built for publication: Simplicial global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851341)
