✦ LIBER ✦

Algorithms for approximating minimization problems in Hilbert spaces

✍ Scribed by Yonghong Yao; Shin Min Kang; Yeong-Cheng Liou

Book ID: 108076798
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 241 KB
Volume: 235
Category: Article
ISSN: 0377-0427
DOI: 10.1016/j.cam.2010.10.055

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cyclic algorithms for split feasibility

Cyclic algorithms for split feasibility problems in Hilbert spaces

✍ Fenghui Wang; Hong-Kun Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 229 KB

The split common fixed point problem (SCFPP) is equivalently converted to a common fixed point problem of a finite family of class-T operators. This enables us to introduce new cyclic algorithms to solve the SCFPP and the multiple-set split feasibility problem.

Penalty Algorithms in Hilbert Spaces

✍ Jean Pierre Dussault; Hai Shen; André Bandrauk 📂 Article 📅 2006 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 173 KB

An algorithm for the minimization of con

An algorithm for the minimization of convex, nondifferentiable functionals in Hilbert space

✍ E. A. Sideri 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 413 KB

Random algorithms for convex minimizatio

Random algorithms for convex minimization problems

✍ Angelia Nedić 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 349 KB

Existence and approximation in control p

Existence and approximation in control problems in Hilbert spaces

✍ J.E Rubio 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 444 KB

Approximating Solutions of Maximal Monot

Approximating Solutions of Maximal Monotone Operators in Hilbert Spaces

✍ Shoji Kamimura; Wataru Takahashi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 154 KB