An inexact steepest descent method for multicriteria optimization on Riemannian manifolds (Q382906): Difference between revisions

A multicriteria optimization problem is considered where the feasible decision space is a complete Riemannian manifold with nonnegative curvature. A version of inexact steepest descent method is considered. Assuming objective functions quasi-convex, the convergence of the proposed algorithm to a Pareto critical point is proved where Pareto critical point is defined as a point satisfying a necessary (but not sufficient) condition of optimality.