"Refining asymptotic complexity bounds for nonconvex optimization methods, ..."

Serge Gratton, Chee-Khian Sim, Philippe L. Toint (2025)

> Home

Details and statistics

DOI: 10.1007/S10589-025-00709-5

access: closed

type: Journal Article

metadata version: 2025-11-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/coap/GrattonST25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coap/GrattonST25
Serge Gratton, Chee-Khian Sim, Philippe L. Toint:
Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(ε ^-2) rather than 풪(ε ^-2). Comput. Optim. Appl. 92(2): 515-527 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.