Box-constrained multi-objective optimization: A gradient-like method without “a priori” scalarization

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 func...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 188; no. 3; pp. 662 - 682
Main Authors:	Miglierina, E., Molho, E., Recchioni, M.C.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.08.2008 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Algorithms Applied sciences Approximation Descent directions Exact sciences and technology Gradient-like method Interior point method Mathematical programming Multiple objective programming Operational research and scientific management Operational research. Management science Optimization Optimization algorithms Problem solving Pseudogradient Studies Vector space Interior point method Descent directions Gradient-like method Pseudogradient Multiple objective programming Pareto optimum Limit point Multiobjective programming Scalarization Critical point Non linear programming Dynamical system Approximation algorithm Constrained optimization Karush Kuhn Tucker method Objective function Gradient method Vector field
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!