A one-step worst-case optimal algorithm for bi-objective univariate optimization
From MaRDI portal
Publication:476260
DOI10.1007/S11590-013-0712-8zbMath1302.90204OpenAlexW1995978080MaRDI QIDQ476260
Publication date: 28 November 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-013-0712-8
Related Items (9)
An approximation algorithm for multi-objective optimization problems using a box-coverage ⋮ A new trisection method for solving Lipschitz bi-objective optimization problems ⋮ On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization ⋮ Visualization of a statistical approximation of the Pareto front ⋮ Bi-objective hypervolume-based Pareto optimization ⋮ On the extension of the \textsc{direct} algorithm to multiple objectives ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Branch and probability bound methods in multi-objective optimization ⋮ A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
Uses Software
Cites Work
- Unnamed Item
- On the worst-case optimal multi-objective global optimization
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Univariate geometric Lipschitz global optimization algorithms
- Deterministic global optimization. Geometric branch-and-bound methods and their applications
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
- A sequentially optimal algorithm for numerical integration
- Nonlinear multiobjective optimization
- A class of test functions for global optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Testing heuristics: We have it all wrong
- A deterministic approach to global box-constrained optimization
- Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
- Introduction to Global Optimization Exploiting Space-Filling Curves
- Best sequential search strategies for finding an extremum
- An algorithm for finding the absolute extremum of a function
- A statistical model-based algorithm for ‘black-box’ multi-objective optimisation
- Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives
- Computational Complexity
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A Sequential Method Seeking the Global Maximum of a Function
- Optimal strategies of the search for an extremum
- Global optimization
- Introduction to global optimization.
This page was built for publication: A one-step worst-case optimal algorithm for bi-objective univariate optimization
