Expected decrease for derivative-free algorithms using random subspaces

Warren Hare, Lindon Roberts, Clément Royer

Open source

DOI
10.1090/mcom/4011
Published
2024-08-23
Container
Mathematics of Computation
Publisher
American Mathematical Society (AMS)
Open access
unknown

Credibility signals

uncertain Score 64/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.1090/mcom/4011,
  title = {Expected decrease for derivative-free algorithms using random subspaces},
  author = {Warren Hare and Lindon Roberts and Clément Royer},
  year = {2024},
  journal = {Mathematics of Computation},
  doi = {10.1090/mcom/4011},
  url = {https://doi.org/10.1090/mcom/4011}
}

RIS

TY  - JOUR
TI  - Expected decrease for derivative-free algorithms using random subspaces
AU  - Warren Hare
AU  - Lindon Roberts
AU  - Clément Royer
PY  - 2024
JO  - Mathematics of Computation
DO  - 10.1090/mcom/4011
UR  - https://doi.org/10.1090/mcom/4011
ER  - 

APA

Hare, W., Roberts, L., & Royer, C. (2024). Expected decrease for derivative-free algorithms using random subspaces. Mathematics of Computation. https://doi.org/10.1090/mcom/4011

Source records