A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
From MaRDI portal
Publication:2095643
DOI10.1016/j.matcom.2022.08.003OpenAlexW4292319852WikidataQ113869114 ScholiaQ113869114MaRDI QIDQ2095643
Publication date: 17 November 2022
Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.matcom.2022.08.003
optimization algorithmsPareto frontbi-objective optimizationbranch and bound methodsAlienor technicalHolder functionstrisection methods
Cites Work
- Unnamed Item
- On the worst-case optimal multi-objective global optimization
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- Multiobjective optimization. Interactive and evolutionary approaches
- Pareto optimality in multiobjective problems
- Nonlinear multiobjective optimization
- Global optimization of Hölder functions
- Stochastic global optimization using tangent minorants for Lipschitz functions
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
- A new trisection method for solving Lipschitz bi-objective optimization problems
- Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- An algorithm for finding the absolute extremum of a function
- Introduction to global optimization.
This page was built for publication: A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
