Inexact proximal point algorithm for quasiconvex optimization problems on Hadamard manifolds

被引：2

作者：

Azami, Shahroud ^{[1
]}

Barani, Ali ^{[2
]}

Oveisiha, Morteza ^{[1
]}

机构：

[1] Imam Khomeini Int Univ, Dept Pure Math, Fac Sci, Qazvin, Iran

[2] Lorestan Univ, Dept Math, Fac Sci, Khorramabad, Iran

来源：

OPTIMIZATION | 2024年 / 73卷 / 01期

关键词：

Proximal point methods; quasiconvex function; Hadamard manifolds; multiobjective optimization; Pareto optimality; LOCALLY LIPSCHITZ FUNCTIONS; MONOTONE VECTOR-FIELDS; MULTIOBJECTIVE OPTIMIZATION; BREGMAN DISTANCES; CONVERGENCE;

D O I：

10.1080/02331934.2022.2094794

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, by using the inexact scalarization proximal methods, we solve quasiconvex multiobjective optimization problems on Hadamard manifolds. Under some assumptions on the multifunction of problem and vector fields, our methods are proved to be convergent to a Pareto critical point of the problem. For the convex case, the sequences generated by the methods converge to a weak Pareto solution.

引用

页码：89 / 112

页数：24

共 43 条

[1]

Absil PA, 2008, OPTIMIZATION ALGORITHMS ON MATRIX MANIFOLDS, P1

[2] Newton's method on Riemannian manifolds and a geometric model for the human spine [J].