On the worst-case optimal multi-objective global optimization
From MaRDI portal
Publication:395864
DOI10.1007/s11590-012-0547-8zbMath1287.90063OpenAlexW2060997116MaRDI QIDQ395864
Publication date: 30 January 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0547-8
Abstract computational complexity for mathematical programming problems (90C60) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Related Items
Integrating \(\varepsilon \)-dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems ⋮ On multi-objective optimization aided drawing of special graphs ⋮ An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making ⋮ A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems ⋮ A new trisection method for solving Lipschitz bi-objective optimization problems ⋮ An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization ⋮ A tutorial on multiobjective optimization: fundamentals and evolutionary methods ⋮ An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation ⋮ Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems ⋮ A Partition Based Bayesian Multi-objective Optimization Algorithm ⋮ A one-step worst-case optimal algorithm for bi-objective univariate optimization ⋮ Covering of high-dimensional cubes and quantization ⋮ Visualization of a statistical approximation of the Pareto front ⋮ Non-lattice Covering and Quantization of High Dimensional Sets ⋮ Solving a set of global optimization problems by the parallel technique with uniform convergence ⋮ An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section ⋮ Worst-case complexity bounds of directional direct-search methods for multiobjective optimization ⋮ A general branch-and-bound framework for continuous global multiobjective optimization ⋮ On efficiency of a single variable bi-objective optimization algorithm ⋮ A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
Cites Work
- Unnamed Item
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- A sequentially optimal algorithm for numerical integration
- Nonlinear multiobjective optimization
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Stochastic global optimization.
- A survey of recent developments in multiobjective optimization
- Handbook of multicriteria analysis
- Sequential Approximate Multiobjective Optimization Using Computational Intelligence
- Best sequential search strategies for finding an extremum
- A statistical model-based algorithm for ‘black-box’ multi-objective optimisation
- Optimal strategies of the search for an extremum
- Introduction to global optimization.
This page was built for publication: On the worst-case optimal multi-objective global optimization
