Beta
ManageSearchChatDiscover
381210

About the relaxed cocoercivity and the convergence of the proximal point algorithm

Article

Last updated: 31 Dec 2024

OverviewSimilar Items

Subjects

-

Tags

-

Abstract

The aim of this paper is to study the convergence of two proximal algorithms via the
notion of (a, r)-relaxed cocoercivity without Lipschitzian continuity. We will show that this notion
is enough to obtain some interesting convergence theorems without any Lipschitz-continuity
assumption. The relaxed cocoercivity case is also investigated.

DOI

10.1016/j.joems.2013.03.014

Keywords

Relaxed cocoercivity, Relaxed monotonicity, Proximal point algorithm, Strong convergence, Variational inequalities

Authors

First Name

Abdellatif

Last Name

Moudafi

MiddleName

-

Affiliation

French West Indies University, Ceregmia-Scientific Department, 97200 Schelcher, Martinique, France

Email

-

City

-

Orcid

-

First Name

Zhenyu

Last Name

Huang

MiddleName

-

Affiliation

Department of Mathematics, Nanjing University, Nanjing 210093, PR China

Email

-

City

-

Orcid

-

Volume

21

Article Issue

2

Related Issue

50482

Issue Date

2013-08-01

Receive Date

2024-09-23

Publish Date

2013-08-01

Page Start

281

Page End

284

Print ISSN

1110-256X

Online ISSN

2090-9128

Article File

JOEMS_Volume 21_Issue 2_Pages 281-284.pdf

PDF . 354.9kB

Link

https://joems.journals.ekb.eg/article_381210.html

Detail API

https://joems.journals.ekb.eg/service?article_code=381210

Order

381,210

Type

Review article

Type Code

3,251

Publication Type

Journal

Publication Title

Journal of the Egyptian Mathematical Society

Publication Link

https://joems.journals.ekb.eg/

MainTitle

About the relaxed cocoercivity and the convergence of the proximal point algorithm

Details

Type

Article

Created At

21 Dec 2024