"Worst Case Complexity Bounds for Linesearch-Type Derivative-Free Algorithms."

Andrea Brilli et al. (2024)

> Home

Details and statistics

DOI: 10.1007/S10957-024-02519-X

access: closed

type: Journal Article

metadata version: 2024-11-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jota/BrilliKLL24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jota/BrilliKLL24
Andrea Brilli, Morteza Kimiaei, Giampaolo Liuzzi, Stefano Lucidi:
Worst Case Complexity Bounds for Linesearch-Type Derivative-Free Algorithms. J. Optim. Theory Appl. 203(1): 419-454 (2024)

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.