✦ LIBER ✦

A proximal algorithm with quasi distance. Application to habit's formation

✍ Scribed by Moreno, Felipe García; Oliveira, Paulo Roberto; Soubeyran, Antoine

Book ID: 119953995
Publisher: Taylor and Francis Group
Year: 2012
Tongue: English
Weight: 225 KB
Volume: 61
Category: Article
ISSN: 0233-1934
DOI: 10.1080/02331934.2011.564623

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Alternating proximal algorithm with cost

Alternating proximal algorithm with costs-to-move, dual description and application to PDE's

✍ Frankel, Pierre 📂 Article 📅 2012 🏛 American Institute of Mathematical Sciences 🌐 English ⚖ 205 KB

Alternating proximal algorithms with asy

Alternating proximal algorithms with asymptotically vanishing coupling. Application to domain decomposition for PDE's

✍ Cabot, A.; Frankel, P. 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 229 KB

A Framework for Analyzing Local Converge

A Framework for Analyzing Local Convergence Properties with Applications to Proximal-Point Algorithms

✍ Y. D. Dong; A. Fischer 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 215 KB

A Minimal Distance Constrained Adaptive

A Minimal Distance Constrained Adaptive Mesh Algorithm with Application to the Dual Reciprocity Method

✍ Kamal Shanazari; Ke Chen 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 146 KB

Convergence analysis of new over-relaxed

Convergence analysis of new over-relaxed proximal point algorithm frameworks with errors and applications to general A-monotone nonlinear inclusion forms

✍ Lan, Heng-you 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Some algorithms for reordering a sequenc

Some algorithms for reordering a sequence of objects, with application to E. Sparre Andersen's principle of equivalence in mathematical statistics

✍ N.G De Bruijn 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 648 KB

Recently A. W. Joseph described an algorithm providing combinatorial insight into E. Sparre Andersen's so-called Principle of Equivalence in mathematical statistics. In the present paper such algorithms are discussed systematically.