Pages that link to "Item:Q1970409"
From MaRDI portal
The following pages link to A class of gradient unconstrained minimization algorithms with adaptive stepsize (Q1970409):
Displayed 17 items.
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- Convergence of descent method with new line search (Q815995) (← links)
- Convergence of quasi-Newton method with new inexact line search (Q819030) (← links)
- Studying the performance of artificial neural networks on problems related to cryptography (Q867941) (← links)
- Multivariate spectral gradient method for unconstrained optimization (Q945298) (← links)
- A new descent algorithm with curve search rule (Q1764727) (← links)
- From linear to nonlinear iterative methods (Q1873166) (← links)
- Convergence of line search methods for unconstrained optimization (Q1881700) (← links)
- Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography (Q2470209) (← links)
- On memory gradient method with trust region for unconstrained optimization (Q2492798) (← links)
- Convergence of nonmonotone line search method (Q2493941) (← links)
- A new gradient method with an optimal stepsize property (Q2506170) (← links)
- Determining the number of real roots of polynomials through neural networks (Q2507014) (← links)
- Convergence of descent method without line search (Q2570691) (← links)
- A new super-memory gradient method with curve search rule (Q2571993) (← links)
- ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH (Q3598837) (← links)
- Artificial nonmonotonic neural networks (Q5958708) (← links)