Pages that link to "Item:Q2250095"

The following pages link to Globally-biased disimpl algorithm for expensive global optimization (Q2250095):

Displaying 50 items.

• Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
• Book review of: R. Paulavičius and J. Žilinskas: Simplicial global optimization (Q475817) (← links)
• Application of reduced-set Pareto-Lipschitzian optimization to truss optimization (Q506481) (← links)
• Improving the convergence rate of the DIRECT global optimization algorithm (Q522279) (← 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)
• SOP: parallel surrogate global optimization with Pareto center selection for computationally expensive single objective problems (Q727388) (← links)
• Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces (Q746814) (← links)
• A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← 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)
• Visualization of a statistical approximation of the Pareto front (Q1732235) (← links)
• On modeling and global solutions for d.c. optimization problems by canonical duality theory (Q1734755) (← 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)
• Solving a set of global optimization problems by the parallel technique with uniform convergence (Q1754445) (← links)
• An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section (Q1754452) (← 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)
• A multi-objective \textbf{DIRECT} algorithm for ship hull optimization (Q1790670) (← links)
• Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} (Q1800457) (← links)
• The DIRECT algorithm: 25 years later (Q2022319) (← links)
• A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem (Q2022324) (← links)
• A derivative-free optimization approach for the autotuning of a forex trading strategy (Q2037890) (← links)
• A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints (Q2047183) (← links)
• On a new smoothing technique for non-smooth, non-convex optimization (Q2061308) (← links)
• SMGO: a set membership approach to data-driven global optimization (Q2065241) (← links)
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints (Q2156486) (← links)
• Safe global optimization of expensive noisy black-box functions in the \(\delta \)-Lipschitz framework (Q2156906) (← links)
• Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms (Q2229118) (← links)
• A modified quasisecant method for global optimization (Q2294744) (← links)
• MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems (Q2349517) (← links)
• Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization (Q2397824) (← links)
• Metaheuristic vs. deterministic global optimization algorithms: the univariate case (Q2422871) (← 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)
• 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)
• 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)
• Escaping local minima with local derivative-free methods: a numerical investigation (Q5093686) (← links)
• Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization (Q5122272) (← links)
• On Acceleration of Derivative-Free Univariate Lipschitz Global Optimization Methods (Q5122321) (← links)
• A Partition Based Bayesian Multi-objective Optimization Algorithm (Q5122343) (← links)
• On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)
• Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization (Q6183089) (← links)
• A new partition method for DIRECT-type algorithm based on minimax design (Q6183090) (← links)