A trust-region approach for computing Pareto fronts in multiobjective optimization

A. Mohammadi () and A. L. Custódio ()
Additional contact information
A. Mohammadi: NOVA School of Science and Technology
A. L. Custódio: NOVA School of Science and Technology

Computational Optimization and Applications, 2024, vol. 87, issue 1, No 5, 149-179

Abstract: Abstract Multiobjective optimization is a challenging scientific area, where the conflicting nature of the different objectives to be optimized changes the concept of problem solution, which is no longer a single point but a set of points, namely the Pareto front. In a posteriori preferences approach, when the decision maker is unable to rank objectives before the optimization, it is important to develop algorithms that generate approximations to the complete Pareto front of a multiobjective optimization problem, making clear the trade-offs between the different objectives. In this work, an algorithm based on a trust-region approach is proposed to approximate the set of Pareto critical points of a multiobjective optimization problem. Derivatives are assumed to be known, allowing the computation of Taylor models for the different objective function components, which will be minimized in two main steps: the extreme point step and the scalarization step. The goal of the extreme point step is to expand the approximation to the Pareto front, by moving towards the extreme points of it, corresponding to the individual minimization of each objective function component. The scalarization step attempts to reduce the gaps on the Pareto front, by solving adequate scalarization problems. The convergence of the method is analyzed and numerical experiments are reported, indicating the relevance of each feature included in the algorithmic structure and its competitiveness, by comparison against a state-of-art multiobjective optimization algorithm.

Keywords: Multiobjective optimization; Trust-region methods; Taylor models; Scalarization techniques; Pareto front (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-023-00510-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:87:y:2024:i:1:d:10.1007_s10589-023-00510-2

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-023-00510-2

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().