Results 211 to 220 of about 19,938 (266)
Some of the next articles are maybe not open access.
Steepest Descent Method with Random Step Lengths
Foundations of Computational Mathematics, 2015The approximative methods for finding of the minimum of twice continuously differentiable functions is a modern approach for solving of this problem. In the present paper, the steepest descent method applied to the minimization of a twice continuously differentiable function is studied.
openaire +2 more sources
Relaxed Steepest Descent and Cauchy-Barzilai-Borwein Method
Computational Optimization and Applications, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raydan, Marcos, Svaiter, Benar F.
openaire +2 more sources
1984
The method of steepest descents or saddle-point method is essentially a generalization of Laplace’s method to integrals in the complex plane. The method originated with Riemann†. It was developed in its present form independently by Debye ‡. Various extensions and rigorous proofs of some of the procedures have been given since their work and some of ...
openaire +1 more source
The method of steepest descents or saddle-point method is essentially a generalization of Laplace’s method to integrals in the complex plane. The method originated with Riemann†. It was developed in its present form independently by Debye ‡. Various extensions and rigorous proofs of some of the procedures have been given since their work and some of ...
openaire +1 more source
A Generalization of the Method of Steepest Descent
IMA Journal of Applied Mathematics, 1972Abstract : The authors consider the asymptotic expansion as lambda approaches infinity of contour integrals with integrand H(lambda w(z)) g(z), H(t) being an entire function of t. When H is the exponential function, the asymptotic expansion of such an integral can be obtained by the method of steepest descent.
Bleistein, Norman +1 more
openaire +2 more sources
The Method of Steepest Descent
1986In Chapter 2, a basic matrix inverse property was used to solve for the optimal mean square error (MSE) weights w N * , producing the solution $$w_N^* = R_{NNPN}^{ - 1}$$ (2.3.6) .
openaire +1 more source
Tensor Steepest Descent Method
2023 International Russian Automation Conference (RusAutoCon), 2023Vasiliy A. Esaulov, Roman M. Sinetsky
openaire +1 more source
Appendix C: Steepest descent method
1995The path CSDP defined by (C.2) is the steepest descent path (or SDP) through the point (ξs, ηs) and, because of the topology illustrated, this point is referred to as the saddle point. The fact that the exponential portion of the integrand in (C.4) decays most rapidly on the SDP simplifies the evaluation of I(κ), and is the primary reason for the path ...
openaire +1 more source
Asymptotics and the method of steepest descent
2020In both pure and applied mathematics, a number of questions lead to estimating integrals of the type.
Richard Beals, Roderick S. C. Wong
openaire +1 more source
A limited memory steepest descent method
Mathematical Programming, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Iteration Steepest Descent Methods for Linear Operator Equations
2000In this chapter we investigate regularizing iteration methods for approximate solution of the nonlinear operator equation $$ A(u) = f $$ (4.1.1) where A (u): U → F is a nonlinear operator, U and F are the Hilbert spaces, f ϵF is the given element. We assume that the equation (4.1.1) has the unique solution ū 0ϵ U.
S. F. Gilyazov, N. L. Gol’dman
openaire +1 more source