My doctoral dissertation work constructs first-order algorithms to solve online multiobjective optimization problems where success of the algorithm is measured by multiobjective performance indicators. In online multiobjective optimization, solutions are computed before the objective functions are revealed. As a result, these solutions are not Pareto for the associated offline multiobjective problem and incur a cost, measured by regret.
Email: ksavary@g.clemson.edu