✦ LIBER ✦

The gradient descent method applied to convex discrete functions

✍ Scribed by M. F. Kaspshitskaya; I. V. Sergienko

Book ID: 105056881
Publisher: Springer US
Year: 1971
Tongue: English
Weight: 145 KB
Volume: 7
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068837

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Steepest Descent Algorithms for Discr

On Steepest Descent Algorithms for Discrete Convex Functions

✍ Murota, Kazuo 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 132 KB

A method to refine the discrete Jensen’s

A method to refine the discrete Jensen’s inequality for convex and mid-convex functions

✍ László Horváth 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Decomposition method of descent for mini

Decomposition method of descent for minimizing the sum of convex nonsmooth functions

✍ K. C. Kiwiel 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 771 KB

Application of gradient descent method t

Application of gradient descent method to the sedimentary grain-size distribution fitting

✍ Haibo Chen; Xianqing Lv; Yansong Qiao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 795 KB

A Dynamical Approach to Convex Minimizat

A Dynamical Approach to Convex Minimization Coupling Approximation with the Steepest Descent Method

✍ H. Attouch; R. Cominetti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 805 KB

We study the asymptotic behavior of the solutions to evolution equations of the form 0 # u\* (t)+ f(u(t), =(t)); u(0)=u 0 , where [ f( } , =): =>0] is a family of strictly convex functions whose minimum is attained at a unique point x(=). Assuming that x(=) converges to a point x\* as = tends to 0,

The complex phase gradient method applie

The complex phase gradient method applied to leaky Lamb waves

✍ Lenoir, O.; Conoir, J. M.; Izbicki, J. L. 📂 Article 📅 2002 🏛 American Institute of Physics 🌐 English ⚖ 454 KB