Complexity of a class of first-order objective-function-free optimization algorithms

Serge Gratton, S. Jerad, Ph. Toint

Open source

DOI
10.1080/10556788.2023.2296431
Published
2024-02-08
Container
Optimization Methods and Software
Publisher
Not recorded
Open access
no

Credibility signals

limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1080/10556788.2023.2296431,
  title = {Complexity of a class of first-order objective-function-free optimization algorithms},
  author = {Serge Gratton and S. Jerad and Ph. Toint},
  year = {2024},
  journal = {Optimization Methods and Software},
  doi = {10.1080/10556788.2023.2296431},
  url = {https://doi.org/10.1080/10556788.2023.2296431}
}

RIS

TY  - JOUR
TI  - Complexity of a class of first-order objective-function-free optimization algorithms
AU  - Serge Gratton
AU  - S. Jerad
AU  - Ph. Toint
PY  - 2024
JO  - Optimization Methods and Software
DO  - 10.1080/10556788.2023.2296431
UR  - https://doi.org/10.1080/10556788.2023.2296431
ER  - 

APA

Gratton, S., Jerad, S., & Toint, P. (2024). Complexity of a class of first-order objective-function-free optimization algorithms. Optimization Methods and Software. https://doi.org/10.1080/10556788.2023.2296431

Source records