View in EDS HTML Full Text PDF Full Text

A Local Nearly Linearly Convergent First-Order Method for Nonsmooth Functions with Quadratic Growth.

Saved in:
Bibliographic Details
Title: A Local Nearly Linearly Convergent First-Order Method for Nonsmooth Functions with Quadratic Growth.
Authors: Davis, Damek1 (AUTHOR) dsd95@cornell.edu, Jiang, Liwei1 (AUTHOR)
Source: Foundations of Computational Mathematics. Jun2025, Vol. 25 Issue 3, p943-1024. 82p.
Subjects: Subgradient methods, Convex functions, Algorithms
Abstract: Classical results show that gradient descent converges linearly to minimizers of smooth strongly convex functions. A natural question is whether there exists a locally nearly linearly convergent method for nonsmooth functions with quadratic growth. This work designs such a method for a wide class of nonsmooth and nonconvex locally Lipschitz functions, including max-of-smooth, Shapiro's decomposable class, and generic semialgebraic functions. The algorithm is parameter-free and derives from Goldstein's conceptual subgradient method. [ABSTRACT FROM AUTHOR]
Copyright of Foundations of Computational Mathematics 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: 185351218
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Local Nearly Linearly Convergent First-Order Method for Nonsmooth Functions with Quadratic Growth.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Davis%2C+Damek%22">Davis, Damek</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> dsd95@cornell.edu</i><br /><searchLink fieldCode="AR" term="%22Jiang%2C+Liwei%22">Jiang, Liwei</searchLink><relatesTo>1</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Foundations+of+Computational+Mathematics%22">Foundations of Computational Mathematics</searchLink>. Jun2025, Vol. 25 Issue 3, p943-1024. 82p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Subgradient+methods%22">Subgradient methods</searchLink><br /><searchLink fieldCode="DE" term="%22Convex+functions%22">Convex functions</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Classical results show that gradient descent converges linearly to minimizers of smooth strongly convex functions. A natural question is whether there exists a locally nearly linearly convergent method for nonsmooth functions with quadratic growth. This work designs such a method for a wide class of nonsmooth and nonconvex locally Lipschitz functions, including max-of-smooth, Shapiro's decomposable class, and generic semialgebraic functions. The algorithm is parameter-free and derives from Goldstein's conceptual subgradient method. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Foundations of Computational Mathematics 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=185351218
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10208-024-09653-y
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 82
        StartPage: 943
    Subjects:
      – SubjectFull: Subgradient methods
        Type: general
      – SubjectFull: Convex functions
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: A Local Nearly Linearly Convergent First-Order Method for Nonsmooth Functions with Quadratic Growth.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Davis, Damek
      – PersonEntity:
          Name:
            NameFull: Jiang, Liwei
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 16153375
          Numbering:
            – Type: volume
              Value: 25
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Foundations of Computational Mathematics
              Type: main
ResultId 1