Optimization Online


A barrier-type method for multiobjective optimization

Ellen H. Fukuda(ellen***at***i.kyoto-u.ac.jp)
L. M. Grana Drummond(bolsigeno***at***gmail.com)
Fernanda M. P. Raupp(fernanda***at***lncc.br)

Abstract: For solving constrained multicriteria problems, we introduce the multiobjective barrier method (MBM), which extends the scalar-valued internal penalty method. This multiobjective version of the classical method also requires a penalty barrier for the feasible set and a sequence of nonnegative penalty parameters. Differently from the single-valued procedure, MBM is implemented by means of an auxiliary "monotonic" real-valued mapping, which may be chosen in a quite large set of functions. Here, we consider problems with continuous objective functions, where the feasible sets are defined by finitely many continuous inequalities. Under mild assumptions, and depending on the monotonicity type of the auxiliary function, we establish convergence to Pareto or weak Pareto optima. Finally, we also propose an implementable version of MBM for seeking local optima and analyze its convergence to Pareto or weak Pareto solutions.

Keywords: Barrier methods, multiobjective optimization, Pareto optimality, penalty methods

Category 1: Other Topics (Multi-Criteria Optimization )

Citation: Kyoto University, Federal University of Rio de Janeiro, National Laboratory for Scientific Computing, March/2018.

Download: [PDF]

Entry Submitted: 03/30/2018
Entry Accepted: 03/30/2018
Entry Last Modified: 03/30/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society