An inexact steepest descent method for multicriteria optimization on Riemannian manifolds (Q382906): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: João Xavier da Cruz Neto / rank | |||
Normal rank | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Antanas Žilinskas / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C29 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C48 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6232040 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
steepest descent | |||
Property / zbMATH Keywords: steepest descent / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Pareto optimality | |||
Property / zbMATH Keywords: Pareto optimality / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multicriteria optimization | |||
Property / zbMATH Keywords: multicriteria optimization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quasi-Fejér convergence | |||
Property / zbMATH Keywords: quasi-Fejér convergence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quasi-convexity | |||
Property / zbMATH Keywords: quasi-convexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Riemannian manifolds | |||
Property / zbMATH Keywords: Riemannian manifolds / rank | |||
Normal rank |
Revision as of 13:09, 29 June 2023
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