A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization

DOI10.1016/J.MATCOM.2022.08.003OpenAlexW4292319852WikidataQ113869114 ScholiaQ113869114MaRDI QIDQ2095643FDOQ2095643

Hamadi Ammar, Bechir Naffeti

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

zbMATH Keywords

optimization algorithmsbi-objective optimizationPareto frontbranch and bound methodsAlienor technicalHolder functionstrisection methods

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Nonlinear multiobjective optimization
• Multi-objective optimization using evolutionary algorithms
• Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
• Multiobjective optimization. Interactive and evolutionary approaches
• Introduction to global optimization.
• On the worst-case optimal multi-objective global optimization
• Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• An algorithm for finding the absolute extremum of a function
• On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
• A one-step worst-case optimal algorithm for bi-objective univariate optimization
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
• Global optimization of Hölder functions
• Pareto optimality in multiobjective problems
• Stochastic global optimization using tangent minorants for Lipschitz functions
• A new trisection method for solving Lipschitz bi-objective optimization problems

Cited In (1)

• A one-step worst-case optimal algorithm for bi-objective univariate optimization

This page was built for publication: A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095643)