On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
From MaRDI portal
Publication:774104
DOI10.1007/BF01831719zbMath0100.14002OpenAlexW4361773666MaRDI QIDQ774104
Publication date: 1959
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01831719
Related Items
On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems, An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization, Algorithms that satisfy a stopping criterion, probably, Stable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environment, Dual techniques for constrained optimization, On initial point selection of the steepest descent algorithm for general quadratic functions, Gradient methods with adaptive step-sizes, Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis, On the worst case performance of the steepest descent algorithm for quadratic functions, Steepest descent method with random step lengths, s-step iterative methods for symmetric linear systems, A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems, A new two-step gradient-type method for large-scale unconstrained optimization, Cooperative concurrent asynchronous computation of the solution of symmetric linear systems, Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems, Stepsize analysis for descent methods, Global convergence of the gradient method for functions definable in o-minimal structures, Gradient method with multiple damping for large-scale unconstrained optimization, On the Forsythe conjecture, Gradient algorithms for quadratic optimization with fast convergence rates, On the steplength selection in gradient methods for unconstrained optimization, A gradient method exploiting the two dimensional quadratic termination property, Fast gradient methods with alignment for symmetric linear systems without using Cauchy step, Discrete processes and their continuous limits, On the Preconditioned Delayed Weighted Gradient Method, An overview of nonlinear optimization, The chaotic nature of faster gradient descent methods, A new analysis on the Barzilai-Borwein gradient method, Unnamed Item, Gradient methods exploiting spectral properties, Some observations on weighted GMRES, An efficient gradient method using the Yuan steplength, Randomized Hessian estimation and directional search, Asymptotic rate of convergence of a two-layer iterative method of the variational type, On the asymptotic behaviour of some new gradient methods, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, Asymptotic behaviour of a family of gradient algorithms in \(\mathbb R^{ d }\) and Hilbert spaces, Scalar correction method for finding least-squares solutions on Hilbert spaces and its applications, Gradient descent and fast artificial time integration, Pattern-recognition by an artificial network derived from biologic neuronal systems, A new gradient method with an optimal stepsize property, Faster gradient descent and the efficient recovery of images, A globally optimal tri-vector method to solve an ill-posed linear system, On the steepest descent algorithm for quadratic functions, On the asymptotic directions of the s-dimensional optimum gradient method, An affine-scaling interior-point CBB method for box-constrained optimization, A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems, On the asymptotic convergence and acceleration of gradient methods, A new gradient method via quasi-Cauchy relation which guarantees descent, Alternate step gradient method*, On \(R\)-linear convergence analysis for a class of gradient methods, A family of spectral gradient methods for optimization, Level set of the asymptotic rate of convergence for the method of steepest descent, Equipping the Barzilai--Borwein Method with the Two Dimensional Quadratic Termination Property, A modified two-point stepsize gradient algorithm for unconstrained minimization, An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems, On the acceleration of the Barzilai-Borwein method
Cites Work
