Pages that link to "Item:Q1916739"
From MaRDI portal
The following pages link to A new unconstrained optimization method for imprecise function and gradient values (Q1916739):
Displayed 15 items.
- Modified nonmonotone Armijo line search for descent method (Q535246) (← links)
- Convergence of descent method with new line search (Q815995) (← links)
- Convergence of quasi-Newton method with new inexact line search (Q819030) (← links)
- New inexact line search method for unconstrained optimization (Q850832) (← links)
- From linear to nonlinear iterative methods (Q1873166) (← links)
- Convergence of line search methods for unconstrained optimization (Q1881700) (← links)
- Locating, characterizing and computing the stationary points of a function (Q1916996) (← links)
- A dimension-reducing method for unconstrained optimization (Q1919374) (← links)
- OPTAC: A portable software package for analyzing and comparing optimization methods by visualization (Q1923623) (← links)
- A class of gradient unconstrained minimization algorithms with adaptive stepsize (Q1970409) (← links)
- The non-monotone conic algorithm (Q3598646) (← links)
- ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH (Q3598837) (← links)
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions (Q5122292) (← links)
- Optimized explicit Runge-Kutta pair of orders \(9(8)\) (Q5939895) (← links)
- Artificial nonmonotonic neural networks (Q5958708) (← links)