You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+3-2Lines changed: 3 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -266,11 +266,12 @@ large constraint violation even though the starting point is feasible.
266
266
### Improvements
267
267
268
268
Thanks to the improvements introduced into the new implementation, PRIMA
269
-
generally produces better solutions with less function evaluations compared with Powell's Fortran 77 implementation. This makes PRIMA preferable for if function evaluations are expensive,
269
+
generally produces better solutions with less function evaluations compared with Powell's Fortran 77 implementation.
270
+
This makes PRIMA preferable **if function evaluations are expensive**,
270
271
which is typically the case for [derivative-free optimization problems](https://github.com/orgs/libprima/discussions/145).
271
272
However, if function evaluations are not the dominant cost in your application,
272
273
The Fortran 77
273
-
solvers are likely to be faster, as it is more efficient in terms of memory usage and flops
274
+
solvers are likely to be faster, as they are more efficient in terms of memory usage and flops
274
275
thanks to the careful and unique (but unmaintained) implementation by Powell.
275
276
276
277
Below are the [performance profiles](https://arxiv.org/pdf/cs/0102001.pdf)
0 commit comments