No label defined (Q3690977)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3915534
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3915534

      Statements

      0 references
      1984
      0 references
      rate of convergence
      0 references
      variable metric algorithms
      0 references
      unconstrained optimization
      0 references
      line searches
      0 references
      [For the entire collection see Zbl 0553.00001.] Various results on the rate of convergence of variable metric algorithms for unconstrained optimization are discussed. Usually line searches are assumed to be perfect and for the strong results one additionally assumes that the matrices formed by n successively occuring normed search directions are bounded away from singularity. Both assumptions fail for many practical problems. Numerical and theoretical results for problems satisfying resp. not satisfying these assumptions are given. In particular, a weaker convergence result without the above assumption on the search directions is derived and an example shows how the use of step-length one instead of perfect line searches severely deteriorates the rate of convergence under the BFGS-update.
      0 references

      Identifiers