✦ LIBER ✦

On Rockafellar’s theorem using proximal point algorithm involving -maximal monotonicity framework

✍ Scribed by Ram U. Verma

Publisher: Elsevier
Year: 2008
Tongue: English
Weight: 460 KB
Volume: 2
Category: Article
ISSN: 1751-570X
DOI: 10.1016/j.nahs.2008.09.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized Eckstein–Bertsekas proximal

Generalized Eckstein–Bertsekas proximal point algorithm involving -monotonicity framework

✍ Ram U. Verma 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 287 KB

Generalized Eckstein–Bertsekas proximal

Generalized Eckstein–Bertsekas proximal point algorithm based on -maximal monotonicity design

✍ Rom U. Verma 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 350 KB

The over-relaxed proximal point algorith

The over-relaxed proximal point algorithm based on -maximal monotonicity design and applications

✍ Ram U. Verma 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 213 KB

First the general framework for a generalized over-relaxed proximal point algorithm using the notion of H -maximal monotonicity (also referred to as H -monotonicity) is developed, and then the convergence analysis for this algorithm in the context of solving a general class of nonlinear inclusion pr

Generalized over-relaxed proximal algori

Generalized over-relaxed proximal algorithm based on A-maximal monotonicity framework and applications to inclusion problems

✍ Ram U. Verma 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 467 KB