The following pages link to On Steepest Descent (Q5626157):
Displayed 50 items.
- Variable metric random pursuit (Q263217) (← links)
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
- Convergence and stability of line search methods for unconstrained optimization (Q385584) (← links)
- A new class of nonlinear conjugate gradient coefficients with global convergence properties (Q387529) (← links)
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- A new class of nonlinear conjugate gradient coefficients with exact and inexact line searches (Q668235) (← links)
- 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)
- A generalized conditional gradient method and its connection to an iterative shrinkage method (Q842768) (← links)
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method (Q869834) (← links)
- Convergence of PRP method with new nonmonotone line search (Q945382) (← links)
- Acceleration of conjugate gradient algorithms for unconstrained optimization (Q1029371) (← 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)
- On the nonmonotonicity degree of nonmonotone line searches (Q1697277) (← links)
- The hybrid BFGS-CG method in solving unconstrained optimization problems (Q1724270) (← 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)
- A natural vector/matrix notation applied in an efficient and robust return-mapping algorithm for advanced yield functions (Q1982348) (← links)
- Hybridization of accelerated gradient descent method (Q1989937) (← links)
- A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems (Q2072782) (← links)
- Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions (Q2163450) (← links)
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints (Q2203094) (← links)
- A survey of gradient methods for solving nonlinear optimization (Q2220680) (← links)
- Levenberg-Marquardt method for solving systems of absolute value equations (Q2255724) (← links)
- Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions (Q2256241) (← links)
- Optimization approach for the Monge-Ampère equation (Q2313143) (← links)
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization (Q2390003) (← 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)