View in EDS HTML Full Text PDF Full Text

On the forward–backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems.

Saved in:
Bibliographic Details
Title: On the forward–backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems.
Authors: Azmi, Behzad1 (AUTHOR) behzad.azmi@uni-konstanz.de, Bernreuther, Marco2 (AUTHOR) marco.bernreuther@iff.uni-stuttgart.de
Source: Computational Optimization & Applications. Jul2025, Vol. 91 Issue 3, p1263-1308. 46p.
Subjects: Computational mathematics, Applied mathematics, Partial differential equations, Nonlinear differential equations, Eigenfunctions
Abstract: This paper provides a comprehensive study of the nonmonotone forward–backward splitting (FBS) method for solving a class of nonsmooth composite problems in Hilbert spaces. The objective function is the sum of a Fréchet differentiable (not necessarily convex) function and a proper lower semicontinuous convex (not necessarily smooth) function. These problems appear, for example, frequently in the context of optimal control of nonlinear partial differential equations (PDEs) with nonsmooth sparsity-promoting cost functionals. We discuss the convergence and complexity of FBS equipped with the nonmonotone linesearch under different conditions. In particular, R-linear convergence will be derived under quadratic growth-type conditions. We also investigate the applicability of the algorithm to problems governed by PDEs. Numerical experiments are also given that justify our theoretical findings. [ABSTRACT FROM AUTHOR]
Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 185809728
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: On the forward–backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Azmi%2C+Behzad%22">Azmi, Behzad</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> behzad.azmi@uni-konstanz.de</i><br /><searchLink fieldCode="AR" term="%22Bernreuther%2C+Marco%22">Bernreuther, Marco</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> marco.bernreuther@iff.uni-stuttgart.de</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computational+Optimization+%26+Applications%22">Computational Optimization & Applications</searchLink>. Jul2025, Vol. 91 Issue 3, p1263-1308. 46p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computational+mathematics%22">Computational mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Applied+mathematics%22">Applied mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Partial+differential+equations%22">Partial differential equations</searchLink><br /><searchLink fieldCode="DE" term="%22Nonlinear+differential+equations%22">Nonlinear differential equations</searchLink><br /><searchLink fieldCode="DE" term="%22Eigenfunctions%22">Eigenfunctions</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper provides a comprehensive study of the nonmonotone forward–backward splitting (FBS) method for solving a class of nonsmooth composite problems in Hilbert spaces. The objective function is the sum of a Fréchet differentiable (not necessarily convex) function and a proper lower semicontinuous convex (not necessarily smooth) function. These problems appear, for example, frequently in the context of optimal control of nonlinear partial differential equations (PDEs) with nonsmooth sparsity-promoting cost functionals. We discuss the convergence and complexity of FBS equipped with the nonmonotone linesearch under different conditions. In particular, R-linear convergence will be derived under quadratic growth-type conditions. We also investigate the applicability of the algorithm to problems governed by PDEs. Numerical experiments are also given that justify our theoretical findings. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=185809728
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10589-025-00684-x
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 46
        StartPage: 1263
    Subjects:
      – SubjectFull: Computational mathematics
        Type: general
      – SubjectFull: Applied mathematics
        Type: general
      – SubjectFull: Partial differential equations
        Type: general
      – SubjectFull: Nonlinear differential equations
        Type: general
      – SubjectFull: Eigenfunctions
        Type: general
    Titles:
      – TitleFull: On the forward–backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Azmi, Behzad
      – PersonEntity:
          Name:
            NameFull: Bernreuther, Marco
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 07
              Text: Jul2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 09266003
          Numbering:
            – Type: volume
              Value: 91
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Computational Optimization & Applications
              Type: main
ResultId 1