A subgradient method for multiobjective optimization on Riemannian manifolds (Q382921)

From MaRDI portal
Revision as of 03:10, 30 January 2024 by Import240129110155 (talk | contribs) (Added link to MaRDI item.)
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

    Identifiers