Pages that link to "Item:Q907199"

The following pages link to Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199):

Displaying 19 items.

• Preface to the special issue NUMTA 2013 (Q907191) (← 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)
• A multi-objective \textbf{DIRECT} algorithm for ship hull optimization (Q1790670) (← links)
• Nonlinear biobjective optimization: improving the upper envelope using feasible line segments (Q2022248) (← links)
• Nonconvex constrained optimization by a filtering branch and bound (Q2038915) (← 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)
• An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems (Q2117623) (← links)
• An approximation algorithm for multi-objective optimization problems using a box-coverage (Q2141729) (← links)
• Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations (Q2154461) (← links)
• On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619) (← links)
• A hybrid of Bayesian approach based global search with clustering aided local refinement (Q2206585) (← links)
• Computationally efficient approach for solving lexicographic multicriteria optimization problems (Q2230779) (← 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)
• A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization (Q4629343) (← links)
• A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems (Q5080393) (← links)
• Reference-point-based branch and bound algorithm for multiobjective optimization (Q6203550) (← links)