Unconstrained steepest descent method for multicriteria optimization on Riemannian manifolds (Q1762393): Difference between revisions

The authors generalize the convergence results of \textit{J. Fliege} and \textit{B. F. Svaiter} [Math. Methods Oper. Res. 51, No. 3, 479--494 (2000; Zbl 1054.90067)] to multicriteria optimization on Riemannian manifolds. Following the ideas of \textit{L. M. Graña Drummond} and \textit{B. F. Svaiter} [J. Comput. Appl. Math. 175, No. 2, 395--414 (2005; Zbl 1058.90060)], they generalize the full convergence result for multicriteria optimization, where the multicriteria function is quasiconvex and the Riemannian manifold has a nonnegative curvature. Some examples of complete Riemannian manifolds with explicit geodesic curves and the steepest descent iteration of the sequence generated by the proposed method are presented.