.png){kind=icon}
.png){kind=icon}
Return
Box-constrained multi-objective optimization: A gradient-like method without a priori scalarization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2007.05.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The aim of this paper is the development of an algorithm to find the critical points of a box-constrained multi-objective optimization problem. The proposed algorithm is an interior point method based on suitable directions that play the role of gradient-like directions for the vector objective function. The method does not rely on an a priori scalarization and is based on a dynamic system defined by a vector field of descent directions in the considered box. The key tool to define the mentioned vector field is the notion of vector pseudogradient. We prove that the limit points of the solutions of the system satisfy the Karush-Kuhn-Tucker (KKT) first order necessary condition for the box-constrained multi-objective optimization problem. These results allow us to develop an algorithm to solve box-constrained multi-objective optimization problems. Finally, we consider some test problems where we apply the proposed computational method. The numerical experience shows that the algorithm generates an approximation of the local optimal Pareto front representative of all parts of optimal front. (C) 2007 Elsevier B.V. All rights reserved.
Keywords:
multiple objective programming
gradient-like method
interior point method
descent directions
pseudogradient
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W