The following pages link to Simplicial Global Optimization (Q2851341):
Displaying 50 items.
- Application of reduced-set Pareto-Lipschitzian optimization to truss optimization (Q506481) (← links)
- MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
- Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants (Q727093) (← links)
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization (Q727229) (← links)
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
- A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
- Generalized parallel computational schemes for time-consuming global optimization (Q1662785) (← links)
- 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 (Q1675572) (← links)
- On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
- Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization (Q1685588) (← links)
- Visualization of a statistical approximation of the Pareto front (Q1732235) (← links)
- A direct search algorithm for global optimization (Q1736805) (← links)
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
- Efficient multicriterial optimization based on intensive reuse of search information (Q1754449) (← links)
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section (Q1754452) (← links)
- Approximating a solution set of nonlinear inequalities (Q1754455) (← links)
- On convergence rate of a rectangular partition based global optimization algorithm (Q1754460) (← links)
- GOSH: derivative-free global optimization using multi-dimensional space-filling curves (Q1754461) (← links)
- A simplicial homology algorithm for Lipschitz optimisation (Q1756767) (← links)
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} (Q1800457) (← links)
- On the search of the shape parameter in radial basis functions using univariate global optimization methods (Q2022236) (← links)
- A \textsc{direct}-type global optimization algorithm for image registration (Q2022242) (← links)
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem (Q2022324) (← links)
- A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem (Q2036141) (← links)
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems (Q2046391) (← links)
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints (Q2047183) (← links)
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems (Q2117623) (← links)
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales (Q2205849) (← links)
- A hybrid of Bayesian approach based global search with clustering aided local refinement (Q2206585) (← links)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere (Q2228375) (← links)
- Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms (Q2229118) (← links)
- Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
- Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
- 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. (Q2280464) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization (Q2397824) (← links)
- Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization (Q2399492) (← links)
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes (Q2422874) (← links)
- 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 (Q2423794) (← links)
- Computing an upper bound on contact stress with surrogate duality (Q2630814) (← links)
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics (Q2660836) (← links)
- Survey of Piecewise Convex Maximization and PCMP over Spherical Sets (Q2958613) (← links)
- On the Least-Squares Fitting of Data by Sinusoids (Q2958622) (← links)
- A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems (Q5080393) (← links)
- Granular sieving algorithm for selecting best n$$ n $$ parameters (Q6087609) (← links)
- Hyperparameter autotuning of programs with HybridTuner (Q6113060) (← links)
