Numerical Methods for Convex Multi-objective Control Problems

Dr C Yalcin Kaya (University of South Australia)

MSI Computational Mathematics

DATE: 2010-06-09
TIME: 14:00:00 - 15:00:00
LOCATION: via Access Grid, in the Baume Theatre (Room 1.04) in the Peter Baume Building (42A)
CONTACT: JavaScript must be enabled to display this email address.

ABSTRACT:
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the solution of the problem scalarized via a convex combination of objectives through a vector of parameters (or weights). Then we establish that (i) the solution of the scalarized (parametric) problem for any given parameter vector is unique and (weakly or properly) efficient and (ii) for each solution in the (weakly or properly) efficient set, there exists at least one corresponding parameter vector for the scalarized problem yielding the same solution. Therefore the set of all parametric solutions (obtained by solving the scalarized problem) is equal to the efficient set. Next we consider an additional objective over the efficient set. Based on the main result, the new objective can instead be considered over the (parametric) solution set of the scalarized problem. For the purpose of constructing numerical methods, we point to existing solution differentiability results for parametric optimal control problems. We propose numerical methods and give an example application to illustrate our approach. This is joint work with Henri Bonnel (University of New Caledonia).

Reference: H. Bonnel and C. Y. Kaya Optimization over the efficient set of multi-objective convex optimal control problems Journal of Optimization Theory and Applications, 147(1), 2010, to appear. (Published online: 11 May 2010. DOI: 10.1007/s10957-010-9709-y)
BIO:
http://www.unisanet.unisa.edu.au/staff/Homepage.asp?Name=Yalcin.Kaya