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.
Alimohammady, M., Ramazannejad, M., Inertial proximal algorithm for difference of two maximal monotone operators, <<INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS>>, 2016; 47 (1): 1-8. [doi:10.1007/s13226-015-0162-3] [https://hdl.handle.net/10807/325304]
Inertial proximal algorithm for difference of two maximal monotone operators
Ramazannejad, Maede
2016
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.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
