- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1687-1847
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
On q-BFGS algorithm for unconstrained optimization problems ; volume:2020 ; number:1 ; day:12 ; month:11 ; year:2020 ; pages:1-24 ; date:12.2020
Advances in difference equations ; 2020, Heft 1 (12.11.2020), 1-24, 12.2020
- Creator
-
Mishra, Shashi Kant
Panda, Geetanjali
Chakraborty, Suvra Kanti
Samei, Mohammad Esmael
Ram, Bhagwat
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1186/s13662-020-03100-2
- URN
-
urn:nbn:de:101:1-2020122319033595835868
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:30 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Mishra, Shashi Kant
- Panda, Geetanjali
- Chakraborty, Suvra Kanti
- Samei, Mohammad Esmael
- Ram, Bhagwat
- SpringerLink (Online service)
Other Objects (12)
A modified nonmonotone BFGS algorithm for unconstrained optimization
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
On the hardness of quadratic unconstrained binary optimization problems
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
Duality in Unconstrained Optimization
Efficient unconstrained black box optimization
Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems
New inertial proximal gradient methods for unconstrained convex optimization problems
Implementable tensor methods in unconstrained convex optimization
Limited memory gradient methods for unconstrained optimization
On the unconstrained optimization reformulations for a class of stochastic vector variational inequality problems
A modified nonmonotone BFGS algorithm for unconstrained optimization
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
On the hardness of quadratic unconstrained binary optimization problems
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
Duality in Unconstrained Optimization
Efficient unconstrained black box optimization
Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems
New inertial proximal gradient methods for unconstrained convex optimization problems
Implementable tensor methods in unconstrained convex optimization
Limited memory gradient methods for unconstrained optimization
On the unconstrained optimization reformulations for a class of stochastic vector variational inequality problems
A modified nonmonotone BFGS algorithm for unconstrained optimization
A q-Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization problems
A Modified Conjugate Gradient Algorithm for Unconstrained Nonlinear Optimization
On the hardness of quadratic unconstrained binary optimization problems
A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
Duality in Unconstrained Optimization
Efficient unconstrained black box optimization
Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems
New inertial proximal gradient methods for unconstrained convex optimization problems
Implementable tensor methods in unconstrained convex optimization
Limited memory gradient methods for unconstrained optimization