A Bregman proximal point algorithm without convexity in Banach spaces

IF 1.6 3区数学 Q2 MATHEMATICS, APPLIED

Optimization Pub Date : 2024-08-06 DOI:10.1080/02331934.2024.2386111

Yantao Yang, Eskandar Naraghirad

引用次数: 0

Abstract

In this paper, we first introduce a Bregman prox-convexity notion as the generalization of the convexity for Bregman prox-convexity in Banach spaces. We verify the single-valudeness and Bregman fir...

查看原文本刊更多论文

巴拿赫空间中无凸性的布雷格曼近点算法

本文首先介绍了一个 Bregman 近凸概念，它是对巴拿赫空间中 Bregman 近凸的凸性的概括。我们验证了Bregman近凸的单无效性和...

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Optimization 数学-应用数学

CiteScore

4.50

自引率

9.10%

发文量

146

审稿时长

4.5 months

期刊介绍： Optimization publishes refereed, theoretical and applied papers on the latest developments in fields such as linear, nonlinear, stochastic, parametric, discrete and dynamic programming, control theory and game theory. A special section is devoted to review papers on theory and methods in interesting areas of mathematical programming and optimization techniques. The journal also publishes conference proceedings, book reviews and announcements. All published research articles in this journal have undergone rigorous peer review, based on initial editor screening and anonymous refereeing by independent expert referees.