Using the second-order information in pareto-set computations of a multi-criteria problem

Authors:
Bart$#322/omiej Jacek Kubica;Adam Woź/niak
Affiliations:
Institute of Control and Computation Engineering, Warsaw University of Technology, Poland;Institute of Control and Computation Engineering, Warsaw University of Technology, Poland
Venue:
PARA'10 Proceedings of the 10th international conference on Applied Parallel and Scientific Computing - Volume 2
Year:
2010

Citing 4
Cited 4

Set inversion via interval analysis for nonlinear bounded-error estimation

Automatica (Journal of IFAC) - Special section on fault detection, supervision and safety for technical processes
Obtaining an outer approximation of the efficient set of nonlinear biobjective problems

Journal of Global Optimization
A population and interval constraint propagation algorithm

EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Interval methods for computing the Pareto-front of a multicriterial problem

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics

Tuning the multithreaded interval method for solving underdetermined systems of nonlinear equations

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Applying an interval method for a four agent economy analysis

PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part II
Tuning the interval algorithm for seeking pareto sets of multi-criteria problems

PARA'12 Proceedings of the 11th international conference on Applied Parallel and Scientific Computing
First order rejection tests for multiple-objective optimization

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents an extension of a previously developed interval method for solving multi-criteria problems [13]. The idea is to use second order information (i.e., Hesse matrices of criteria and constraints) in a way analogous to global optimization (see e.g. [6], [9]). Preliminary numerical results are presented and parallelization of the algorithm is considered.