[counters]

Yeah, I agree 100% - I really support the approach of the developer here and am totally aligned with all the reasoning.

The libprima/prima codebase is very readable, even if you're not accustomed to modern Fortran (let alone Fortran period). It has fantastic comments throughout the numerical algorithms, and even though there are a lot of lines of code, in most places it really seems to be a minimally-complex implementation with very little magic. I haven't built anything against the codebase yet but based on the examples I feel it will be far easier than many other libraries out there.

A motivated developer could very quickly port this code to their preferred numerical programming language.

[zaikunzhang]

Thank you so much for your very warm and encouraging comments!

PRIMA has been a black hole that absorbs all my time and energy in the past three years, which even puts my career (as a junor professor) in real danger. The positive feedback like yours is vital for me. Without it, I would not have the energe or courage to continue. Many thanks!

> A motivated developer could very quickly port this code to their preferred numerical programming language.

I am much glad to hear a person other than myself saying this. It is the very reason why I develop this reference implementation. PRIMA achieves its success if others can implement Powell's solvers to high quality using PRIMA as a referene, without the genius like Powell and without the long-term experience and strugling like me.

Many thanks! --- Zaikun

[counters]

Hey, all the thanks go to you! I really wish we could do more to reward contributions like this when they're coming from folks in the academic world... the impact of this work is easily on par with anything else you could do as a junior faculty.

Have you considered setting up a regular search on GitHub to try to find public codebases that are likely using your library? That might be a great complementary set of statistics that you can use to promote the impact of this work.