The following pages link to On Steepest Descent (Q5626157):
Displayed 39 items.
- Constrained linear quadratic Gaussian control with process applications (Q791497) (← links)
- Convergence of descent method with new line search (Q815995) (← links)
- Convergence of quasi-Newton method with new inexact line search (Q819030) (← links)
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method (Q869834) (← links)
- Convergence of PRP method with new nonmonotone line search (Q945382) (← links)
- An efficient line search for nonlinear least squares (Q1057187) (← links)
- A self-tuning regulator based on optimal output feedback theory (Q1057223) (← links)
- Conjugate gradient algorithms in nonlinear structural analysis problems (Q1077990) (← links)
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities (Q1101344) (← links)
- Properties of the sequential gradient-restoration algorithm (SGRA). II: Convergence analysis (Q1106734) (← links)
- Efficient hybrid conjugate gradient techniques (Q1117142) (← links)
- On recursive averaging processes and Hilbert space extensions of the contraction mapping principle (Q1214123) (← links)
- Convexity, monotonicity, and gradient processes in Hilbert space (Q1223622) (← links)
- Conditional gradient algorithms with open loop step size rules (Q1244889) (← links)
- Nonoptimal termination properties of quadratic interpolation univariate searches (Q1249520) (← links)
- In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization (Q1255894) (← links)
- A generalized conjugate gradient algorithm (Q1265069) (← links)
- A multi-local optimization algorithm (Q1265238) (← links)
- A comparison of nonlinear optimization methods for supervised learning in multilayer feedforward neural networks (Q1268172) (← links)
- MERLIN-3. 0. A multidimensional optimization environment (Q1299612) (← links)
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds (Q1341568) (← links)
- A globalization procedure for solving nonlinear systems of equations (Q1815701) (← links)
- On the convergence of projected gradient processes to singular critical points (Q1821692) (← links)
- Efficent line search algorithm for unconstrained optimization (Q1896577) (← links)
- A class of gradient unconstrained minimization algorithms with adaptive stepsize (Q1970409) (← links)
- Memory gradient method with Goldstein line search (Q2469911) (← links)
- On step-size estimation of line search methods (Q2489176) (← links)
- Convergence of nonmonotone line search method (Q2493941) (← links)
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion (Q2502232) (← links)
- An effective algorithm for minimization (Q2528326) (← links)
- Ein iteratives Verfahren zur Bestimmung einer Lösung gewisser nichtlinearer Operatorgleichungen im Hilbertraum mit Anwendung auf Hammersteinsche Integralgleichungssysteme (Q2536222) (← links)
- An application of the generalized Aitken-Steffensen method to the problem of minimizing a function (Q2559909) (← links)
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature (Q3865866) (← links)
- A discrete Newton algorithm for minimizing a function of many variables (Q3934149) (← links)
- On the selection of parameters in Self Scaling Variable Metric Algorithms (Q4051920) (← links)
- Self-Scaling Variable Metric Algorithms without Line Search for Unconstrained Minimization (Q4060281) (← links)
- Optimal conditioning of self-scaling variable Metric algorithms (Q4110808) (← links)
- Optimization of lipschitz continuous functions (Q4177351) (← links)
- Choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally lipschitz) lower-semi-continuous minimization problem (Q4894151) (← links)