On Necessary Optimality Conditions for Sets of Points in Multiobjective Optimization
Open Access
- 3 July 2024
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 203 (1) , 126-145
Abstract
Taking inspiration from what is commonly done in single-objective optimization, most local algorithms proposed for multiobjective optimization extend the classical iterative scalar methods and produce sequences of points able to converge to single efficient points. Recently, a growing number of local algorithms that build sequences of sets has been devised, following the real nature of multiobjective optimization, where the aim is that of approximating the efficient set. This calls for a new analysis of the necessary optimality conditions for multiobjective optimization. We explore conditions for sets of points that share the same features of the necessary optimality conditions for single-objective optimization. On the one hand, from a theoretical point of view, these conditions define properties that are necessarily satisfied by the (weakly) efficient set. On the other hand, from an algorithmic point of view, any set that does not satisfy the proposed conditions can be easily improved by using first-order information on some objective functions. We analyse both the unconstrained and the constrained case, giving some examples.Keywords
Funding Information
- Università degli Studi di Roma La Sapienza
This publication has 24 references indexed in Scilit:
- A limited memory Quasi-Newton approach for multi-objective optimizationComputational Optimization and Applications, 2023
- Globally convergent Newton-type methods for multiobjective optimizationComputational Optimization and Applications, 2022
- An approximation algorithm for multi-objective optimization problems using a box-coverageJournal of Global Optimization, 2021
- A general branch-and-bound framework for continuous global multiobjective optimizationJournal of Global Optimization, 2021
- An augmented Lagrangian algorithm for multi-objective optimizationComputational Optimization and Applications, 2020
- On the convergence of steepest descent methods for multiobjective optimizationComputational Optimization and Applications, 2020
- Nonlinear Programming2005
- Approximation Methods in Multiobjective ProgrammingJournal of Optimization Theory and Applications, 2005
- Steepest descent methods for multicriteria optimizationMathematical Methods of Operations Research, 2000
- Theory of Vector Optimization1989