A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2251-7456
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization ; day:5 ; month:11 ; year:2019 ; pages:1-9
Mathematical sciences ; (5.11.2019), 1-9
- Urheber
-
Kaelo, P.
Mtagulwa, P.
Thuto, M. V.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s40096-019-00310-y
- URN
-
urn:nbn:de:101:1-2020030223222902910400
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:51 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Kaelo, P.
- Mtagulwa, P.
- Thuto, M. V.
- SpringerLink (Online service)
Ähnliche Objekte (12)
Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
A scaled three-term conjugate gradient method for unconstrained optimization
The new spectral conjugate gradient method for large-scale unconstrained optimisation
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
A detailed survey of numerical methods for unconstrained minimization, Pt. 1.. Conjugate direction and gradient methods
Limited memory gradient methods for unconstrained optimization
A Modified Conjugate Gradient Algorithm
Globally convergent method for designing twice spline contractual function
A Globally Convergent MCA Algorithm by Generalized Eigen-Decomposition
Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
A scaled three-term conjugate gradient method for unconstrained optimization
The new spectral conjugate gradient method for large-scale unconstrained optimisation
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
A detailed survey of numerical methods for unconstrained minimization, Pt. 1.. Conjugate direction and gradient methods
Limited memory gradient methods for unconstrained optimization
A Modified Conjugate Gradient Algorithm
Globally convergent method for designing twice spline contractual function
A Globally Convergent MCA Algorithm by Generalized Eigen-Decomposition
Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
A scaled three-term conjugate gradient method for unconstrained optimization
The new spectral conjugate gradient method for large-scale unconstrained optimisation
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
A detailed survey of numerical methods for unconstrained minimization, Pt. 1.. Conjugate direction and gradient methods
Limited memory gradient methods for unconstrained optimization
A Modified Conjugate Gradient Algorithm
Globally convergent method for designing twice spline contractual function