All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A conjugate directions approach to improve the limited-memory BFGS method

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F12%3A00378976" target="_blank" >RIV/67985807:_____/12:00378976 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.amc.2012.06.042" target="_blank" >http://dx.doi.org/10.1016/j.amc.2012.06.042</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.amc.2012.06.042" target="_blank" >10.1016/j.amc.2012.06.042</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A conjugate directions approach to improve the limited-memory BFGS method

  • Original language description

    Simple modifications of the limited-memory BFGS method (L-BFGS) for large scale unconstrained optimization are considered, which consist in corrections (derived from the idea of conjugate directions) of the used difference vectors, utilizing informationfrom the preceding iteration. For quadratic objective functions, the improvement of convergence is the best one in some sense and all stored difference vectors are conjugate for unit stepsizes. Global convergence of the algorithm is established for convex sufficiently smooth functions. Numerical experiments indicate that the new method often improves the L-BFGS method significantly.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • 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

    2012

  • 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

  • Name of the periodical

    Applied Mathematics and Computation

  • ISSN

    0096-3003

  • e-ISSN

  • Volume of the periodical

    219

  • Issue of the periodical within the volume

    3

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    10

  • Pages from-to

    800-809

  • UT code for WoS article

    000310501700004

  • EID of the result in the Scopus database