A family of modified spectral projection methods for nonlinear monotone equations with convex constraint (Q2214774)

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 7283660
Language Label Description Also known as
default for all languages
No label defined
    English
    A family of modified spectral projection methods for nonlinear monotone equations with convex constraint
    scientific article; zbMATH DE number 7283660

      Statements

      A family of modified spectral projection methods for nonlinear monotone equations with convex constraint (English)
      0 references
      0 references
      0 references
      0 references
      10 December 2020
      0 references
      Summary: In this paper, we propose a family of modified spectral projection methods for nonlinear monotone equations with convex constraints, where the spectral parameter is mainly determined by a convex combination of the modified long Barzilai-Borwein stepsize and the modified short Barzilai-Borwein stepsize. We obtain a trial point by the spectral method and then get the iteration point by the projection technique. The algorithm can generate a bounded iterative sequence automatically, and we obtain the global convergence of the proposed method in the sense that every limit point is a solution of the nonlinear equation. The proposed method can be used to resolve the large-scale nonlinear monotone equations with convex constraints including smooth and nonsmooth equations. Numerical results for nonlinear equation problems and the \(\ell_1\)-norm regularization problem in compressive sensing demonstrate the efficiency and efficacy of our method.
      0 references
      0 references
      0 references

      Identifiers

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