A new trisection method for solving Lipschitz bi-objective optimization problems

DOI10.1016/j.matcom.2021.07.011OpenAlexW3186000274MaRDI QIDQ2666322

Bechir Naffeti, Hamadi Ammar

Publication date: 22 November 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2021.07.011

zbMATH Keywords

Lipschitz functionsPareto frontoptimization algorithmbi-objective optimizationbranch and boundsAlienor technicaltrisection methods

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the worst-case optimal multi-objective global optimization
• Reducing transformation and global optimization
• A one-step worst-case optimal algorithm for bi-objective univariate optimization
• Continuous global optimization through the generation of parametric curves
• 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
• On the placement of open-loop robotic manipulators for reachability
• Nonlinear multiobjective optimization
• The alpha algorithm and the application of the cubic algorithm in case of unknown Lipschitz constant
• On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
• A new extension of Piyavskii's method to Hölder functions of several variables
• Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
• A deterministic algorithm for global multi-objective optimization
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• Generation of α‐dense curves and application to global optimization
• An algorithm for finding the absolute extremum of a function
• A Sequential Method Seeking the Global Maximum of a Function

This page was built for publication: A new trisection method for solving Lipschitz bi-objective optimization problems