Inertial proximal algorithm for difference of two maximal monotone operators

M. Alimohammady () and M. Ramazannejad ()
Additional contact information
M. Alimohammady: University of Mazandaran
M. Ramazannejad: University of Mazandaran

Indian Journal of Pure and Applied Mathematics, 2016, vol. 47, issue 1, 1-8

Abstract: Abstract In this note, a new algorithm is presented for finding a zero of difference of two maximal monotone operators T and S, i.e., T — S in finite dimensional real Hilbert space H in which operator S has local boundedness property. This condition is weaker than Moudafi’s condition on operator S in [13]. Moreover, applying some conditions on inertia term in new algorithm, one can improve speed of convergence of sequence.

Keywords: Maximal monotone operator; proximal point algorithm (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s13226-015-0162-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:47:y:2016:i:1:d:10.1007_s13226-015-0162-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-015-0162-3

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().