On the worst-case optimal multi-objective global optimization
From MaRDI portal
(Redirected from Publication:395864)
Recommendations
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- scientific article; zbMATH DE number 757681
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Optimal algorithms for global optimization in case of unknown Lipschitz constant
Cites work
- scientific article; zbMATH DE number 5487989 (Why is no real title available?)
- A sequentially optimal algorithm for numerical integration
- A statistical model-based algorithm for `black-box' multi-objective optimisation
- A survey of recent developments in multiobjective optimization
- Best sequential search strategies for finding an extremum
- Handbook of multicriteria analysis
- Introduction to global optimization.
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Nonlinear multiobjective optimization
- Optimal strategies of the search for an extremum
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- Sequential Approximate Multiobjective Optimization Using Computational Intelligence
- Stochastic global optimization.
Cited in
(23)- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
- An adaptive consensus based method for multi-objective optimization with uniform Pareto front approximation
- On efficiency of a single variable bi-objective optimization algorithm
- Visualization of a statistical approximation of the Pareto front
- A tutorial on multiobjective optimization: fundamentals and evolutionary methods
- A new trisection method for solving Lipschitz bi-objective optimization problems
- Non-lattice Covering and Quantization of High Dimensional Sets
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section
- On multi-objective optimization aided drawing of special graphs
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- A hybrid of Bayesian-based global search with Hooke-Jeeves local refinement for multi-objective optimization problems
- A general branch-and-bound framework for continuous global multiobjective optimization
- Improving exploration strategies in large dimensions and rate of convergence of global random search algorithms
- 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
- An approach to generate comprehensive piecewise linear interpolation of Pareto outcomes to aid decision making
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- An upper bound on the Hausdorff distance between a Pareto set and its discretization in bi-objective convex quadratic optimization
- A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization
- Integrating -dominance and RBF surrogate optimization for solving computationally expensive many-objective optimization problems
- Solving a set of global optimization problems by the parallel technique with uniform convergence
- A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
This page was built for publication: On the worst-case optimal multi-objective global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q395864)
