A scaled three-term conjugate gradient method for unconstrained optimization
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1029-242X
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
A scaled three-term conjugate gradient method for unconstrained optimization ; volume:2016 ; number:1 ; day:13 ; month:12 ; year:2016 ; pages:1-16 ; date:12.2016
Journal of inequalities and applications ; 2016, Heft 1 (13.12.2016), 1-16, 12.2016
- Urheber
-
Arzuka, Ibrahim
- Beteiligte Personen und Organisationen
-
Abu Bakar, Mohd R.
Leong, Wah June
SpringerLink (Online service)
- DOI
-
10.1186/s13660-016-1239-1
- URN
-
urn:nbn:de:1111-201701096085
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:47 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
- Arzuka, Ibrahim
- Abu Bakar, Mohd R.
- Leong, Wah June
- SpringerLink (Online service)
Ähnliche Objekte (12)
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
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 globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
Limited memory gradient methods for unconstrained optimization
A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
The new spectral conjugate gradient method for large-scale unconstrained optimisation
Conjugate gradient algorithms in nonconvex optimization
New inertial proximal gradient methods for unconstrained convex optimization problems
Duality in Unconstrained Optimization
A detailed survey of numerical methods for unconstrained minimization, Pt. 1.. Conjugate direction and gradient methods
Efficient unconstrained black box optimization
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
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 globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
Limited memory gradient methods for unconstrained optimization
A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
The new spectral conjugate gradient method for large-scale unconstrained optimisation
Conjugate gradient algorithms in nonconvex optimization
New inertial proximal gradient methods for unconstrained convex optimization problems
Duality in Unconstrained Optimization
A detailed survey of numerical methods for unconstrained minimization, Pt. 1.. Conjugate direction and gradient methods
Efficient unconstrained black box optimization
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
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 globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
Limited memory gradient methods for unconstrained optimization
A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
The new spectral conjugate gradient method for large-scale unconstrained optimisation
Conjugate gradient algorithms in nonconvex optimization
New inertial proximal gradient methods for unconstrained convex optimization problems
Duality in Unconstrained Optimization
A detailed survey of numerical methods for unconstrained minimization, Pt. 1.. Conjugate direction and gradient methods