✦ LIBER ✦

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

✍ Scribed by Frankel, Pierre

Book ID: 119942693
Publisher: American Institute of Mathematical Sciences
Year: 2012
Tongue: English
Weight: 205 KB
Volume: 5
Category: Article
ISSN: 1937-1632
DOI: 10.3934/dcdss.2012.5.545

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 New Class of Alternating Proximal Mini

A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move

✍ Attouch, H.; Redont, P.; Soubeyran, A. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 328 KB

Alternating proximal algorithms for line

Alternating proximal algorithms for linearly constrained variational inequalities: Application to domain decomposition for PDE’s

✍ H. Attouch; A. Cabot; P. Frankel; J. Peypouquet 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 352 KB

A proximal algorithm with quasi distance

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

✍ Moreno, Felipe García; Oliveira, Paulo Roberto; Soubeyran, Antoine 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 225 KB

Application of genetic algorithm to stoc

Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs

✍ Hussain, S.A; Sastry, V.U.K 📂 Article 📅 1999 🏛 Taylor and Francis Group 🌐 English ⚖ 322 KB

An alternating trilinear decomposition a

An alternating trilinear decomposition algorithm with application to calibration of HPLC–DAD for simultaneous determination of overlapped chlorinated aromatic hydrocarbons

✍ Hai-Long Wu; Masami Shibukawa; Koichi Oguma 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB

In this paper an alternating trilinear decomposition (ATLD) algorithm that is an improvement of the traditional PARAFAC algorithm without any constraints is described as an alternative algorithm for decomposition of threeway data arrays. It is based on an alternating least squares principle and an i