Limited-memory Variable Metric Methods that use Quantities from the Preceding Iteration
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F10%3A00358545" target="_blank" >RIV/67985807:_____/10:00358545 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Limited-memory Variable Metric Methods that use Quantities from the Preceding Iteration
Original language description
In this contribution, a new family of globally convergent limited-memory (LM) variable metric (VM) line search methods for unconstrained minimization is presented. Numerical results indicate that the new methods can save computational time substantiallyfor certain problems in comparison with the well-known L-BFGS method.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F09%2F1957" target="_blank" >GA201/09/1957: Development of methods for solving large scale nonlinear programming and nonsmooth optimization problems</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Programs and Algorithms of Numerical Mathematics
ISBN
978-80-85823-57-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
227-232
Publisher name
MÚ AV ČR, v. v. i.
Place of publication
Praha
Event location
Dolní Maxov
Event date
Jun 6, 2010
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—