An inexact steepest descent method for multicriteria optimization on Riemannian manifolds (Q382906): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Glaydston C. Bento / rank | |||
Property / author | |||
Property / author: João Xavier da Cruz Neto / rank | |||
Property / author | |||
Property / author: Paulo Sérgio M. Santos / rank | |||
Property / author | |||
Property / author: João Xavier da Cruz Neto / rank | |||
Revision as of 12:30, 12 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An inexact steepest descent method for multicriteria optimization on Riemannian manifolds |
scientific article |
Statements
An inexact steepest descent method for multicriteria optimization on Riemannian manifolds (English)
0 references
22 November 2013
0 references
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.
0 references
steepest descent
0 references
Pareto optimality
0 references
multicriteria optimization
0 references
quasi-Fejér convergence
0 references
quasi-convexity
0 references
Riemannian manifolds
0 references