A new adaptive algorithm for convex quadratic multicriteria optimization


Fliege, Jörg, Heermann, Christoph and Weyers, Bernd (2004) A new adaptive algorithm for convex quadratic multicriteria optimization. In, Branke, J., Deb, K., Miettinen, K. and Steuer, R.E. (eds.) Practical Approaches to Multi-Objective Optimization. Dagstuhl, Germany, Schloss Dagstuhl. (Dagstuhl Seminar Proceedings 04461).

Download

Full text not available from this repository.

Description/Abstract

We present a new adaptive algorithm for convex quadratic multicriteria optimization. The algorithm is able to adaptively rene the approximation to the set of ecient points by way of a warm-start interior-point scalarization approach. Numerical results show that this technique is faster than a standard method used for this problem.

Item Type: Book Section
Related URLs:
Subjects: Q Science > QA Mathematics
Divisions: University Structure - Pre August 2011 > School of Mathematics > Operational Research
Item ID: 177345
Date Deposited: 18 Mar 2011 08:26
Last Modified: 02 Mar 2012 13:59
Contributors: Fliege, Jörg (Author)
Heermann, Christoph (Author)
Weyers, Bernd (Author)
Branke, J. (Editor)
Deb, K. (Editor)
Miettinen, K. (Editor)
Steuer, R.E. (Editor)
Date: April 2004
Status: Published
Publisher: Schloss Dagstuhl
URI: http://eprints.soton.ac.uk/id/eprint/177345

Actions (login required)

View Item View Item