Pages that link to "Item:Q395864"

The following pages link to On the worst-case optimal multi-objective global optimization (Q395864):

Displaying 20 items.

• On multi-objective optimization aided drawing of special graphs (Q299425) (← links)
• A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260) (← links)
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
• Visualization of a statistical approximation of the Pareto front (Q1732235) (← 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)
• Worst-case complexity bounds of directional direct-search methods for multiobjective optimization (Q2026717) (← links)
• A general branch-and-bound framework for continuous global multiobjective optimization (Q2038927) (← links)
• A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization (Q2095643) (← links)
• Integrating \(\varepsilon \)-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems (Q2124811) (← links)
• On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619) (← links)
• Covering of high-dimensional cubes and quantization (Q2225655) (← links)
• On efficiency of a single variable bi-objective optimization algorithm (Q2300650) (← links)
• An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making (Q2397433) (← links)
• A new trisection method for solving Lipschitz bi-objective optimization problems (Q2666322) (← links)
• An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization (Q2678998) (← links)
• A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems (Q5080393) (← links)
• A tutorial on multiobjective optimization: fundamentals and evolutionary methods (Q6084236) (← links)
• An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation (Q6133674) (← links)
• Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms (Q6183083) (← links)