A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287)

From MaRDI portal





scientific article; zbMATH DE number 7187332
Language Label Description Also known as
default for all languages
No label defined
    English
    A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
    scientific article; zbMATH DE number 7187332

      Statements

      A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      7 April 2020
      0 references
      Nonlinear conjugate gradient methods (CG) are among the most preferred for solving large-scale smooth problems because of their simplicity and low memory requirement. This paper presents the modified CG method, which includes the advantages of the CG methods for solving large-scale nonsmooth convex optimization problems. This method has the strong global convergence property of Dai and Yuan (DY) method and numerical efficiency of Hestenes and Stiefel (HS) method. The new method uses the search direction, which generates sufficient descent property and belongs to a trust region. Numerical results indicate that the method performs very well.
      0 references
      conjugate gradient method
      0 references
      Moreau-Yosida regularization
      0 references
      nonsmooth large-scale problems
      0 references
      global convergence
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references