On the convergence of multiplicative iterative algorithms with inexact line search (Q1375334)

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 1104076
Language Label Description Also known as
default for all languages
No label defined
    English
    On the convergence of multiplicative iterative algorithms with inexact line search
    scientific article; zbMATH DE number 1104076

      Statements

      On the convergence of multiplicative iterative algorithms with inexact line search (English)
      0 references
      14 January 1998
      0 references
      This paper considers an inexact line search for a class of methods, multiplicative iterative algorithms, applicable to problems with non-negativity constraints. Convergence is proven.
      0 references
      convergence
      0 references
      inexact line search
      0 references
      multiplicative iterative algorithms
      0 references
      non-negativity constraints
      0 references
      0 references

      Identifiers