From f5f2881a440d8061d8984310ff2d94437fd7e50b Mon Sep 17 00:00:00 2001
From: Lindon Roberts <lindon.roberts@anu.edu.au>
Date: Mon, 16 Sep 2024 13:44:33 +1000
Subject: [PATCH] Updated citations in readme

---
 README.rst | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/README.rst b/README.rst
index c13e44a..52f6164 100644
--- a/README.rst
+++ b/README.rst
@@ -41,13 +41,13 @@ See manual.pdf or the `online manual <https://numericalalgorithmsgroup.github.io
 
 Citation
 --------
-If you use Py-BOBYQA in a paper, please cite:
+Full details of the Py-BOBYQA algorithm are given in our papers: 
 
-Cartis, C., Fiala, J., Marteau, B. and Roberts, L., Improving the Flexibility and Robustness of Model-Based Derivative-Free Optimization Solvers, *ACM Transactions on Mathematical Software*, 45:3 (2019), pp. 32:1-32:41.
+1. Coralia Cartis, Jan Fiala, Benjamin Marteau and Lindon Roberts, `Improving the Flexibility and Robustness of Model-Based Derivative-Free Optimization Solvers <https://doi.org/10.1145/3338517>`_, *ACM Transactions on Mathematical Software*, 45:3 (2019), pp. 32:1-32:41 [`preprint <https://arxiv.org/abs/1804.00154>`_] 
+2. Coralia Cartis, Lindon Roberts and Oliver Sheridan-Methven, `Escaping local minima with derivative-free methods: a numerical investigation <https://doi.org/10.1080/02331934.2021.1883015>`_, *Optimization*, 71:8 (2022), pp. 2343-2373. [`arXiv preprint: 1812.11343 <https://arxiv.org/abs/1812.11343>`_]
+3. Lindon Roberts, `Model Construction for Convex-Constrained Derivative-Free Optimization <https://arxiv.org/abs/2403.14960>`_, *arXiv preprint arXiv:2403.14960* (2024).
 
-If you use Py-BOBYQA's global optimization heuristic, please cite the above and also
-
-Cartis, C., Roberts, L. and Sheridan-Methven, O., Escaping local minima with derivative-free methods: a numerical investigation, Optimization, 71:8 (2022), pp. 2343-2373. 
+Please cite [1] when using Py-BOBYQA for local optimization, [1,2] when using Py-BOBYQA's global optimization heuristic functionality, and [1,3] if using the general convex constraints functionality.
 
 Requirements
 ------------