On Steepest Descent
From MaRDI portal
Publication:5626157
DOI10.1137/0303013zbMath0221.65094MaRDI QIDQ5626157
Publication date: 1965
Published in: Journal of the Society for Industrial and Applied Mathematics Series A Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0303013
65K05: Numerical mathematical programming methods
90C99: Mathematical programming
65J99: Numerical analysis in abstract spaces
Related Items
Choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally lipschitz) lower-semi-continuous minimization problem, Constrained linear quadratic Gaussian control with process applications, Convergence of descent method with new line search, Convergence of quasi-Newton method with new inexact line search, Convergence of the Polak-Ribiére-Polyak conjugate gradient method, Convergence of PRP method with new nonmonotone line search, An efficient line search for nonlinear least squares, A self-tuning regulator based on optimal output feedback theory, Conjugate gradient algorithms in nonlinear structural analysis problems, Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities, Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis, Efficient hybrid conjugate gradient techniques, On recursive averaging processes and Hilbert space extensions of the contraction mapping principle, Convexity, monotonicity, and gradient processes in Hilbert space, Conditional gradient algorithms with open loop step size rules, Nonoptimal termination properties of quadratic interpolation univariate searches, In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization, A generalized conjugate gradient algorithm, A multi-local optimization algorithm, A comparison of nonlinear optimization methods for supervised learning in multilayer feedforward neural networks, MERLIN-3. 0. A multidimensional optimization environment, On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds, A globalization procedure for solving nonlinear systems of equations, On the convergence of projected gradient processes to singular critical points, Efficent line search algorithm for unconstrained optimization, A class of gradient unconstrained minimization algorithms with adaptive stepsize, Memory gradient method with Goldstein line search, On step-size estimation of line search methods, Convergence of nonmonotone line search method, An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion, An effective algorithm for minimization, Ein iteratives Verfahren zur Bestimmung einer Lösung gewisser nichtlinearer Operatorgleichungen im Hilbertraum mit Anwendung auf Hammersteinsche Integralgleichungssysteme, An application of the generalized Aitken-Steffensen method to the problem of minimizing a function, Curvilinear path steplength algorithms for minimization which use directions of negative curvature, A discrete Newton algorithm for minimizing a function of many variables, On the selection of parameters in Self Scaling Variable Metric Algorithms, Optimal conditioning of self-scaling variable Metric algorithms, Optimization of lipschitz continuous functions, Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization
