250406.215519.CST Documentation: fix grammar mistakes and sentences with ambiguity

Author: zaikunzhang

README.md

@@ -266,7 +266,7 @@ large constraint violation even though the starting point is feasible.
 ### Improvements
 
 Thanks to the improvements introduced into the new implementation, PRIMA
-generally produces better solutions with less function evaluations compared with Powell's Fortran 77 implementation.
+generally produces better solutions with fewer function evaluations compared with Powell's Fortran 77 implementation.
 This makes PRIMA preferable **if function evaluations are expensive**,
 which is typically the case for [derivative-free optimization problems](https://github.com/orgs/libprima/discussions/145).
 However, if function evaluations are not the dominant cost in your application (e.g., a function
@@ -345,7 +345,7 @@ support from the optimization community and beyond.
 
 The development of PRIMA would have been a mission impossible without the groundwork laid by the [PDFO](https://www.pdfo.net)
 package of [Tom M. Ragonneau](https://ragonneau.github.io) and Zaikun Zhang.
-PDFO is Chapter 3 of Ragonneau's [thesis](https://theses.lib.polyu.edu.hk/handle/200/12294) co-supervised by Zaikun Zhang 
+PDFO is Chapter 3 of Ragonneau's [thesis](https://theses.lib.polyu.edu.hk/handle/200/12294) co-supervised by Zaikun Zhang
 and Professor [Xiaojun Chen](https://www.polyu.edu.hk/ama/staff/xjchen/ChenXJ.htm),
 with financial support from the [Hong Kong Ph.D. Fellowship Scheme](https://cerg1.ugc.edu.hk/hkpfs/index.html) (ref. PF18-24698).
 

pyprima/README.md

@@ -1,9 +1,9 @@
 ## About
 
-This is a Python translation of the [modern-Fortran reference implementation](https://github.com/libprima/prima/tree/main/fortran)
+This is a Python translation of [Zaikun Zhang](https://www.zhangzk.net)'s [modern-Fortran reference implementation](https://github.com/libprima/prima/tree/main/fortran)
 for Powell's derivative-free optimization solvers, which is available at `fortran/` under the root directory.
 It is supposed to be a faithful translation, [producing bit-for-bit identical results](https://github.com/scipy/scipy/pull/22350#issue-2795978526).
-as the Fortran reference implementation
+as the modern-Fortran reference implementation.
 If you notice a difference, [raise an issue](https://github.com/libprima/prima/issues/new).
 
 Due to [bug-fixes](https://github.com/libprima/prima#bug-fixes) and [improvements](https://github.com/libprima/prima#improvements),
@@ -13,7 +13,7 @@ even though the algorithms are essentially the same. Therefore, it is important
 PRIMA rather than the original solvers if you want your results to be reproducible.
 
 Compared to Powell's Fortran 77 implementation, the modern-Fortran implementation and hence any faithful
-translation like this one generally [produce better solutions with less function evaluations](https://github.com/libprima/prima#improvements),
+translation like this one generally [produce better solutions with fewer function evaluations](https://github.com/libprima/prima#improvements),
 making them preferable for [applications with expensive function evaluations](https://github.com/orgs/libprima/discussions/145).
 However, if function evaluations are not the dominant cost in your application, the Fortran 77
 solvers are likely to be faster, as they are more efficient in terms of memory usage and flops
@@ -32,7 +32,7 @@ To develop, `cd` into the `src` directory and run
 
 ```pip install --editable .```
 
-This will install prima locally in an editable fashion. From there you can run the examples/cobyla/cobyla_example.py (from any directory) and go from there.
+This will install PRIMA locally in an editable fashion. From there you can run the examples/cobyla/cobyla_example.py (from any directory) and go from there.
 
 ### Style notes
 

pyprima/src/pyprima/cobyla/cobyla.py

@@ -1,11 +1,11 @@
 '''
 This module provides Powell's COBYLA algorithm.
 
-Translated from the modern-Fortran reference implementation in PRIMA by Zaikun ZHANG (www.zhangzk.net).
+Translated from Zaikun Zhang's modern-Fortran reference implementation in PRIMA.
 
 Dedicated to late Professor M. J. D. Powell FRS (1936--2015).
 
-Python implementation by Nickolai Belakovski
+Python translation by Nickolai Belakovski.
 
 N.B.:
 
@@ -15,7 +15,7 @@
 you are using PRIMA rather than the original solvers if you want your results to be reproducible.
 
 2. Compared to Powell's Fortran 77 implementation, the modern-Fortran implementation and hence any
-faithful translation like this one generally produce better solutions with less function evaluations,
+faithful translation like this one generally produce better solutions with fewer function evaluations,
 making them preferable for applications with expensive function evaluations. However, if function
 evaluations are not the dominant cost in your application, the Fortran 77 solvers are likely to be
 faster, as they are more efficient in terms of memory usage and flops thanks to the careful and

pyprima/src/pyprima/cobyla/cobylb.py

@@ -1,11 +1,11 @@
 '''
 This module performs the major calculations of COBYLA.
 
-Translated from the modern-Fortran reference implementation in PRIMA by Zaikun ZHANG (www.zhangzk.net).
+Translated from Zaikun Zhang's modern-Fortran reference implementation in PRIMA.
 
 Dedicated to late Professor M. J. D. Powell FRS (1936--2015).
 
-Python implementation by Nickolai Belakovski
+Python translation by Nickolai Belakovski.
 '''
 
 import numpy as np

pyprima/src/pyprima/cobyla/geometry.py

@@ -1,11 +1,11 @@
 '''
 This module contains subroutines concerning the geometry-improving of the interpolation set.
 
-Translated from the modern-Fortran reference implementation in PRIMA by Zaikun ZHANG (www.zhangzk.net).
+Translated from Zaikun Zhang's modern-Fortran reference implementation in PRIMA.
 
 Dedicated to late Professor M. J. D. Powell FRS (1936--2015).
 
-Python implementation by Nickolai Belakovski
+Python translation by Nickolai Belakovski.
 '''
 
 from ..common.consts import DEBUGGING

pyprima/src/pyprima/cobyla/initialize.py

@@ -1,11 +1,11 @@
 '''
 This module contains subroutines for initialization.
 
-Translated from the modern-Fortran reference implementation in PRIMA by Zaikun ZHANG (www.zhangzk.net).
+Translated from Zaikun Zhang's modern-Fortran reference implementation in PRIMA.
 
 Dedicated to late Professor M. J. D. Powell FRS (1936--2015).
 
-Python implementation by Nickolai Belakovski
+Python translation by Nickolai Belakovski.
 '''
 
 from ..common.checkbreak import checkbreak_con

pyprima/src/pyprima/cobyla/trustregion.py

@@ -1,11 +1,11 @@
 '''
 This module provides subroutines concerning the trust-region calculations of COBYLA.
 
-Translated from the modern-Fortran reference implementation in PRIMA by Zaikun ZHANG (www.zhangzk.net).
+Translated from Zaikun Zhang's modern-Fortran reference implementation in PRIMA.
 
 Dedicated to late Professor M. J. D. Powell FRS (1936--2015).
 
-Python implementation by Nickolai Belakovski
+Python translation by Nickolai Belakovski.
 '''
 
 import numpy as np

pyprima/src/pyprima/cobyla/update.py

@@ -1,11 +1,11 @@
 '''
 This module contains subroutines concerning the update of the interpolation set.
 
-Translated from the modern-Fortran reference implementation in PRIMA by Zaikun ZHANG (www.zhangzk.net).
+Translated from Zaikun Zhang's modern-Fortran reference implementation in PRIMA.
 
 Dedicated to late Professor M. J. D. Powell FRS (1936--2015).
 
-Python implementation by Nickolai Belakovski
+Python translation by Nickolai Belakovski.
 '''
 
 from ..common.consts import DEBUGGING

pyprima/src/pyprima/common/_project.py

@@ -41,10 +41,8 @@ def _project(x0, lb, ub, constraints):
 
     Authors
     -------
-    Tom M. RAGONNEAU ([email protected])
-    and Zaikun ZHANG ([email protected])
-    Department of Applied Mathematics,
-    The Hong Kong Polytechnic University.
+    Tom M. RAGONNEAU (ragonneau.github.io)
+    and Zaikun ZHANG (www.zhangzk.net)
 
     Dedicated to the late Professor M. J. D. Powell FRS (1936--2015).
     """

pyprima/src/pyprima/common/checkbreak.py

@@ -1,11 +1,11 @@
 '''
 This module checks whether to break out of the solver loop.
 
-Translated from the modern-Fortran reference implementation in PRIMA by Zaikun ZHANG (www.zhangzk.net).
+Translated from Zaikun Zhang's modern-Fortran reference implementation in PRIMA.
 
 Dedicated to late Professor M. J. D. Powell FRS (1936--2015).
 
-Python implementation by Nickolai Belakovski
+Python translation by Nickolai Belakovski.
 '''
 
 from .infos import INFO_DEFAULT, NAN_INF_X, NAN_INF_F, FTARGET_ACHIEVED, MAXFUN_REACHED