Proximal point type algorithms with relaxed and inertial effects beyond convexity

IF 1.6 3区数学 Q2 MATHEMATICS, APPLIED

Optimization Pub Date : 2024-03-20 DOI:10.1080/02331934.2024.2329779

S.-M. Grad, F. Lara, R. T. Marcavillaca

引用次数: 0

Abstract

We show that the recent relaxed-inertial proximal point algorithm due to Attouch and Cabot remains convergent when the function to be minimized is not convex, being only endowed with certain genera...

查看原文本刊更多论文

具有超越凸性的松弛和惯性效应的近点类型算法

我们证明，当要最小化的函数不是凸函数时，Attouch 和 Cabot 最近提出的松弛惯性近点算法仍然是收敛的。

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

求助全文

约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.