A subgradient method for multiobjective optimization on Riemannian manifolds (Q382921): 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 | |||
The authors propose a subgradient-type method for solving a multiobjective optimization problem whose objective function, \(F=(f_1,\dots,f_m) : M \to \mathbb{R}^m\), is convex on an \(n\)-dimensional Riemannian manifold \(M\) (i.e., componentwise convex along geodesic segments joining any points of \(M\)). If this iterative method stops at some iteration, then it generates a Pareto critical point, which is actually a weak Pareto optimal point. Otherwise, it generates a sequence of points, which converges to a Pareto optimal point under appropriate assumptions. | |||
Property / review text: The authors propose a subgradient-type method for solving a multiobjective optimization problem whose objective function, \(F=(f_1,\dots,f_m) : M \to \mathbb{R}^m\), is convex on an \(n\)-dimensional Riemannian manifold \(M\) (i.e., componentwise convex along geodesic segments joining any points of \(M\)). If this iterative method stops at some iteration, then it generates a Pareto critical point, which is actually a weak Pareto optimal point. Otherwise, it generates a sequence of points, which converges to a Pareto optimal point under appropriate assumptions. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Nicolae Popovici / 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: 6232050 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multiobjective optimization | |||
Property / zbMATH Keywords: multiobjective optimization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Pareto optimal point | |||
Property / zbMATH Keywords: Pareto optimal point / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
weak Pareto optimal point | |||
Property / zbMATH Keywords: weak Pareto optimal point / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Pareto critical point | |||
Property / zbMATH Keywords: Pareto critical point / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
subgradient method | |||
Property / zbMATH Keywords: subgradient method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quasi-Féjer convergence | |||
Property / zbMATH Keywords: quasi-Féjer convergence / rank | |||
Normal rank |
Revision as of 12:10, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A subgradient method for multiobjective optimization on Riemannian manifolds |
scientific article |
Statements
A subgradient method for multiobjective optimization on Riemannian manifolds (English)
0 references
22 November 2013
0 references
The authors propose a subgradient-type method for solving a multiobjective optimization problem whose objective function, \(F=(f_1,\dots,f_m) : M \to \mathbb{R}^m\), is convex on an \(n\)-dimensional Riemannian manifold \(M\) (i.e., componentwise convex along geodesic segments joining any points of \(M\)). If this iterative method stops at some iteration, then it generates a Pareto critical point, which is actually a weak Pareto optimal point. Otherwise, it generates a sequence of points, which converges to a Pareto optimal point under appropriate assumptions.
0 references
multiobjective optimization
0 references
Pareto optimal point
0 references
weak Pareto optimal point
0 references
Pareto critical point
0 references
subgradient method
0 references
quasi-Féjer convergence
0 references