Pages that link to "Item:Q1402152"

The following pages link to Local tuning and partition strategies for diagonal GO methods (Q1402152):

Displaying 20 items.

• Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← 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)
• 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)
• Multidimensional Lipschitz global optimization based on efficient diagonal partitions (Q1029568) (← links)
• Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← 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)
• Efficient multicriterial optimization based on intensive reuse of search information (Q1754449) (← links)
• GOSH: derivative-free global optimization using multi-dimensional space-filling curves (Q1754461) (← 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)
• The DIRECT algorithm: 25 years later (Q2022319) (← links)
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints (Q2156486) (← links)
• A hybrid of Bayesian approach based global search with clustering aided local refinement (Q2206585) (← links)
• Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
• Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes (Q2422874) (← links)