View in EDS

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is rather than.

Saved in:
Bibliographic Details
Title: Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is rather than.
Authors: Gratton, S.1, serge.gratton@enseeiht.fr, Sim, C.-K.2, chee-khian.sim@port.ac.uk, Toint, Ph. L.3, philippe.toint@unamur.be
Source: Computational Optimization & Applications; Nov2025, Vol. 92 Issue 2, p515-527, 13p
Database: Applied Science & Technology Source
FullText Text:
  Availability: 0
Header DbId: aci
DbLabel: Applied Science & Technology Source
An: 189054724
AccessLevel: 2
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is rather than.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AU" term="%22Gratton%2C+S%2E%22">Gratton, S.</searchLink><relatesTo>1</relatesTo>, <i>serge.gratton@enseeiht.fr</i><br /><searchLink fieldCode="AU" term="%22Sim%2C+C%2E-K%2E%22">Sim, C.-K.</searchLink><relatesTo>2</relatesTo>, <i>chee-khian.sim@port.ac.uk</i><br /><searchLink fieldCode="AU" term="%22Toint%2C+Ph%2E+L%2E%22">Toint, Ph. L.</searchLink><relatesTo>3</relatesTo>, <i>philippe.toint@unamur.be</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computational+Optimization+%26+Applications%22">Computational Optimization & Applications</searchLink>; Nov2025, Vol. 92 Issue 2, p515-527, 13p
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=aci&AN=189054724
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10589-025-00709-5
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 13
        StartPage: 515
    Titles:
      – TitleFull: Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is rather than.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Gratton, S.
      – PersonEntity:
          Name:
            NameFull: Sim, C.-K.
      – PersonEntity:
          Name:
            NameFull: Toint, Ph. L.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 11
              Text: Nov2025
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 09266003
          Numbering:
            – Type: volume
              Value: 92
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Computational Optimization & Applications
              Type: main
ResultId 1