https://github.com/libprima/prima
PRIMA is a package for solving general nonlinear optimization problems without using derivatives. It provides the reference implementation for Powell's derivative-free optimization methods, i.e., COBYLA, UOBYQA, NEWUOA, BOBYQA, and LINCOA. PRIMA means Reference Implementation for Powell's methods with Modernization and Amelioration, P for Powell.
https://github.com/libprima/prima
blackbox-optimization bobyqa cobyla constrained-optimization derivative-free-optimization lincoa matlab modern-fortran newuoa nonlinear-optimization numerical-optimization optimization powell prima python simulation-based-optimization unconstrained-optimization uobyqa zeroth-order-method
Last synced: 13 days ago
JSON representation
PRIMA is a package for solving general nonlinear optimization problems without using derivatives. It provides the reference implementation for Powell's derivative-free optimization methods, i.e., COBYLA, UOBYQA, NEWUOA, BOBYQA, and LINCOA. PRIMA means Reference Implementation for Powell's methods with Modernization and Amelioration, P for Powell.
- Host: GitHub
- URL: https://github.com/libprima/prima
- Owner: libprima
- License: bsd-3-clause
- Created: 2020-06-10T11:33:09.000Z (almost 5 years ago)
- Default Branch: main
- Last Pushed: 2025-04-01T11:54:35.000Z (21 days ago)
- Last Synced: 2025-04-01T12:44:52.659Z (21 days ago)
- Topics: blackbox-optimization, bobyqa, cobyla, constrained-optimization, derivative-free-optimization, lincoa, matlab, modern-fortran, newuoa, nonlinear-optimization, numerical-optimization, optimization, powell, prima, python, simulation-based-optimization, unconstrained-optimization, uobyqa, zeroth-order-method
- Language: Fortran
- Homepage: http://libprima.net
- Size: 20.3 MB
- Stars: 338
- Watchers: 4
- Forks: 43
- Open Issues: 53
-
Metadata Files:
- Readme: README.md
- Changelog: NEWS.md
- Codeowners: .github/CODEOWNERS
Awesome Lists containing this project
README
PRIMA: Reference Implementation for Powell's Methods with Modernization and Amelioration
Dedicated to the late Professor M. J. D. Powell FRS (1936--2015)
- [What](#what)
- [Why](#why)
- [How](#how)
- [Current status](#current-status)
- [Modern Fortran](#modern-fortran)
- [C](#c)
- [Python](#python)
- [MATLAB](#matlab)
- [Julia](#julia)
- [Other languages](#other-languages)
- [Bug fixes](#bug-fixes)
- [Improvements](#improvements)
- [Who was Powell?](#who-was-powell)
- [A "fun" fact](#a-fun-fact)
- [Acknowledgment](#acknowledgment)
- [Citing PRIMA](#citing-prima)
- [Charityware](#charityware)
- [Contact](#contact)
- [Mirrors](#mirrors)
- [Gitee](https://gitee.com/libprima/prima)
- [GitHub](https://github.com/libprima/prima)
- [GitLab](https://gitlab.com/libprima/prima)
- [Star history](#star-history)
### What
PRIMA is a package for **solving general nonlinear optimization problems without using derivatives**.
It provides the reference implementation for Powell's renowned derivative-free optimization methods, i.e., COBYLA, UOBYQA, NEWUOA, BOBYQA, and LINCOA.
The "P" in the name stands for [**P**owell](https://www.zhangzk.net/powell.html),
and "RIMA" is an acronym for "**R**eference **I**mplementation with **M**odernization and **A**melioration".
The current version is ready to be used [in Fortran](#modern-fortran), [in C](#c),
[in Python](https://github.com/libprima/prima#python),
[in MATLAB](https://github.com/libprima/prima/blob/main/README_mat.md),
and [in Julia](https://juliahub.com/ui/Packages/General/PRIMA).
PRIMA was initiated by [Zaikun Zhang](https://www.zhangzk.net) in July 2020, based on
the [PDFO](https://www.pdfo.net) package.
See [Zaikun Zhang's talk](https://raw.githubusercontent.com/ztalks/20230825-iciam23/main/20230825-iciam.pdf)
on PRIMA at [The 10th International Congress on Industrial and Applied Mathematics](https://iciam2023.org/) for more information.
### Why
Professor Powell carefully implemented his derivative-free optimization methods into publicly available solvers,
which are genuine masterpieces. They are widely used by engineers and scientists. For instance,
see Section 1 of [a recent paper on Powell's solvers](https://arxiv.org/pdf/2302.13246.pdf)
as well as the Google searches of [COBYLA](https://www.google.com/search?q=cobyla)
and [BOBYQA](https://www.google.com/search?q=bobyqa).
However, Professor Powell's implementation was done in [Fortran 77](./fortran/original).
The code is nontrivial to understand or maintain, let alone extend.
For many practitioners, this has become an obstacle to exploiting these solvers in their
applications. Even worse, it has hindered researchers from exploring the wealth left by Professor
Powell. By all means, it is
[necessary to make the solvers available in languages other than Fortran](https://permalink.lanl.gov/object/tr?what=info:lanl-repo/lareport/LA-UR-23-23992)
promptly, first wrapping Powell's code, which is the objective of [PDFO](https://www.pdfo.net),
and then providing native and modernized implementations, which is the mission of PRIMA.
Before he passed, Professor Powell had asked me and
[Professor Nick Gould](https://www.numerical.rl.ac.uk/people/nimg) to maintain his solvers.
This is an honorable mission. To make the solvers more accessible, I started PRIMA.
It is a project similar to the translation, interpretation, and annotation of Euclid’s
*Elements*. It will make Powell's solvers easily understandable to everyone, not only the experts.
Few people remember [who translated *Elements*](https://en.wikipedia.org/wiki/Euclid%27s_Elements#Translations),
but it is a job that must be done.
PRIMA aims to provide the reference implementation of Powell's methods in modern languages,
including [**modern** Fortran](https://fortran-lang.org) (F2008 or newer), C/C++, Python, MATLAB,
Julia, and R. It will be a **faithful** implementation, in the sense that the code will be
mathematically equivalent to Powell’s, **except for** the
[bug fixes](#bug-fixes) and [improvements](#improvements) made intentionally.
The focus is to implement these methods in a **structured** and **modularized** way so that they
are **understandable**, **maintainable**, **extendable**, **fault-tolerant**, and **future-proof**.
The code will **have no GOTO** (of course)
and will **use matrix-vector procedures instead of loops** whenever possible.
In doing so, PRIMA codes the algorithms **in a way that we would present them on a blackboard**.
Such an implementation will enable us to get a deeper understanding of Powell's methods and
pave the way for new developments based on them.
There do exist "translations" of Powell's Fortran 77 code in other languages. For example,
[NLopt](https://github.com/stevengj/nlopt) contains a C version of COBYLA, NEWUOA, and BOBYQA,
but the C code in NLopt is translated from the Fortran 77 code straightforwardly, if
not automatically by [f2c](https://netlib.org/f2c/f2c.pdf), and hence inherits the style, structure,
and probably [bugs](#bug-fixes) of the original Fortran 77 implementation.
Note, however, that
[Py-BOBYQA](https://numericalalgorithmsgroup.github.io/pybobyqa/) is a **true translation** of BOBYQA
to Python, with significant improvements.
### How
The mission of PRIMA is nontrivial due to the delicacy of Powell's algorithms and the unique style
of his code. To ensure the faithfulness of PRIMA,
the **modern** Fortran version was started by refactoring Powell's code into the free form via a small
[MATLAB tool](./matlab/setup_tools/freeform.m).
However, such refactored code is far from what is desired, because it inherits completely
the structure and style of Powell's code except for the layout. Significant modifications are needed
to reorganize (indeed, to **rewrite**) the code. To maintain the faithfulness and quality of the
reference implementation, extensive tests are conducted after each and every tiny modification,
using the [CUTEst](https://github.com/ralna/CUTEst) problems via [MatCUTEst](https://github.com/matcutest/matcutest).
The tests do not only verify the faithfulness of the implementation but also check that **the solvers
behave properly even if they are invoked with improper inputs or [encounter failures of function
evaluations](https://github.com/libprima/prima/blob/main/matlab/tests/private/tough.m)**.
[**Stress tests**](#stress-tests) are also conducted
periodically to verify that the solvers work correctly without running into errors when applied to
**excessively large problems**.
[The tests](./tests.md) are **automated** by
[GitHub Actions](https://docs.github.com/en/actions).
As of August 2023, more than
45,000 "workflows" have been successfully run by GitHub Actions. Normally, each workflow consists of \~ 5
([sometimes more than 200](https://github.com/primalib/prima/actions/runs/5763631681))
**randomized** tests,
each test taking from tens of minutes to several hours (the maximum
is 6 hours, after which the test will be canceled automatically). In other words,
PRIMA has been verified by more than 200,000 hours (or **more than 20 years**) of randomized tests.
**Code must be battle-tested before becoming software.**
### Current status
#### Modern Fortran
After almost **three** years of intensive coding, the [modern Fortran version](./fortran) of
PRIMA was finished by December 2022.
It can be compiled using CMake as follows.
```bash
git clone --depth 1 https://github.com/libprima/prima.git
cd prima
cmake -S . -B build -DCMAKE_INSTALL_PREFIX=install
cmake --build build --target install
```
This should create the `primaf` library for Fortran usage, located in the `install/lib/` directory
to be used with the module files in `install/include/prima/mod/`.
In case CMake fails to find your Fortran compiler,
you can indicate it by specifying `-DCMAKE_Fortran_COMPILER=/path/to/your/Fortran/compiler`.
Similarly, set `-DCMAKE_C_COMPILER=/path/to/your/C/compiler` for your C compiler if needed.
Examples on how to use the library from an external code are available in [`fortran/examples/`](https://github.com/libprima/prima/tree/main/fortran/examples).
Below is an illustration with COBYLA.
```bash
cd fortran/examples/cobyla
cmake -S . -B build -DCMAKE_INSTALL_PREFIX=install -DPRIMA_DIR=$PWD/../../../install/lib/cmake/prima/
cmake --build build --target install
LD_LIBRARY_PATH=$LD_LIBRARY_PATH:$PWD/../../../install/lib ./install/bin/cobyla_example_1
```
#### C
A C binding to the Fortran library is available in the [`c/` folder](https://github.com/libprima/prima/tree/main/c).
In the same way as the Fortran library, it can be [compiled using CMake](#cmake),
which should also create the `primac` library for C compilation, located in `install/lib/` to be used with the `prima.h` header in `install/include/prima/`.
Examples on how to use the library from an external code are available in [`c/examples/`](https://github.com/libprima/prima/tree/main/c/examples).
Below is an illustration with COBYLA.
```bash
cd c/examples/cobyla
cmake -S . -B build -DCMAKE_INSTALL_PREFIX=install -DPRIMA_DIR=$PWD/../../../install/lib/cmake/prima/
cmake --build build --target install
LD_LIBRARY_PATH=$LD_LIBRARY_PATH:$PWD/../../../install/lib ./install/bin/cobyla_example
```
#### Python
- An [interface](./python) is provided for [using the **modern** Fortran implementation in Python](./python/examples/rosenbrock.py).
- SciPy 1.16.0 replaces the [buggy](#bug-fixes) and unmaintained Fortran 77 version of [COBYLA underlying `scipy.optimize.minimize`](https://docs.scipy.org/doc/scipy/reference/optimize.minimize-cobyla.html#optimize-minimize-cobyla) with the PRIMA version, which is a **faithful** Python translation of the **[modern Fortran implementation](./fortran/cobyla)**.
#### MATLAB
- An [interface](./matlab/interfaces/prima.m) is provided for [using the **modern** Fortran implementation in MATLAB](./README_mat.md).
- A [pure MATLAB version of NEWUOA](./matlab/interfaces/+newuoa_mat/) is implemented. It was
generated straightforwardly (indeed, **automatically**) from an earlier version of the
**modern** Fortran code (with the help of Mr. Galann Pennec). The other four solvers will be
implemented in MATLAB similarly.
#### Julia
- A [Julia interface](https://juliahub.com/ui/Packages/General/PRIMA) is provided
by [`PRIMA.jl`](https://github.com/libprima/prima.jl).
It is registered in the General Registry of Julia as
[`PRIMA`](https://github.com/JuliaRegistries/General/tree/master/P/PRIMA).
#### Other languages
- Interfaces for using the modern Fortran implementation in other languages will be available later.
- Given the **modern** Fortran version, **native implementations** in other languages
become **much easier**, because we now have a structured and modularized implementation as a reference.
My team will implement the methods in other languages in this way.
For instance, see the [MATLAB version of NEWUOA](https://github.com/libprima/prima/blob/main/matlab/interfaces/%2Bnewuoa_mat)
and the [Python version of COBYLA](https://github.com/libprima/prima/tree/main/pyprima/src/pyprima/cobyla)
([included in SciPy](https://docs.scipy.org/doc/scipy/reference/optimize.minimize-cobyla.html#optimize-minimize-cobyla) since 1.16.0).
This is the main motivation for developing the **modern** Fortran version first —
to provide a modernized reference implementation for the development in other languages.
### Bug fixes
PRIMA has fixed some **serious** issues in the **original Fortran 77 implementation** of Powell's methods.
Note that all of them are problems in the Fortran 77 code rather than flaws in the algorithms.
The examples given below are bugs or requests sent to [SciPy](https://github.com/scipy/scipy),
[NLopt](https://github.com/stevengj/nlopt),
[nloptr](https://github.com/astamm/nloptr),
[OpenTURNS](https://github.com/openturns/openturns),
etc., which are reputable packages that wrap/interface the **original Fortran 77 implementation**
of Powell's solver. Inevitably, they suffer from the bugs in the Fortran 77 code.
- The Fortran 77 solvers may get **stuck** in infinite loops.
- [optimize: COBYLA hangs / infinite loop #8998](https://github.com/scipy/scipy/issues/8998)
- [BUG: Scipy.optimize / COBYLA hangs on some CPUs #15527](https://github.com/scipy/scipy/issues/15527)
- [COBYLA freezes (though maxeval and maxtime are given) #370](https://github.com/stevengj/nlopt/issues/370)
- [COBYLA hangs #118](https://github.com/stevengj/nlopt/issues/118)
- [NEWUOA_BOUND stuck in infinite loop inside MMA #117](https://github.com/stevengj/nlopt/issues/117)
- [Cobyla freezes in 0T1.16rc1 #1651](https://github.com/openturns/openturns/issues/1651)
- [Optimization freezes #25](https://github.com/astamm/nloptr/issues/25)
- [BOBYQA gets stuck in infinite loop. #7](https://github.com/cureos/csnumerics/issues/7)
- [Cobyla turns into infinite loop and never finishes #8](https://github.com/cureos/csnumerics/issues/8)
- [Algorithm turns into infinite loop and never finishes #3](https://github.com/xypron/jcobyla/issues/3)
- [The Fortran 77 version of UOBYQA encounters infinite cyclings very often if PRIMA_REAL_PRECISION is 32](https://github.com/libprima/prima/issues/98)
- The Fortran 77 solvers may **crash** with [segmentation faults](https://en.wikipedia.org/wiki/Segmentation_fault)
due to uninitialized variables that are used as indices.
- [Fix all uninitialized variable warnings #134](https://github.com/stevengj/nlopt/issues/134)
- [BOBYQA uninitialised variables in rare cases #133](https://github.com/stevengj/nlopt/issues/133)
- [Use of uninitialized variable in BOBYQA altmov #36](https://github.com/stevengj/nlopt/issues/36)
- Fortran 77 COBYLA may **not return the best point** that is evaluated; sometimes, the returned point can have a
large constraint violation even though the starting point is feasible.
- [nlopt COBYLA optimizer gives unexpected output #182](https://github.com/stevengj/nlopt/issues/182)
- [Last Result Returned Not Optimized Result #110](https://github.com/stevengj/nlopt/issues/110)
- [COBYLA returns last evaluated function which might not be minimum #57](https://github.com/stevengj/nlopt/issues/57)
- [Successful termination when constraints violated #1](https://github.com/cureos/jcobyla/issues/1)
### Improvements
Thanks to the improvements introduced into the new implementation, PRIMA
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
evaluation takes only milliseconds), 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 ingenious (but unmaintained and unmaintainable) implementation by Powell.
Below are the [performance profiles](https://arxiv.org/pdf/cs/0102001.pdf)
of the PRIMA solvers compared with Powell's implementation in terms of the **number of function evaluations**,
the convergence tolerance being $\tau = 10^{-6}$.
Roughly speaking, performance profiles plot the percentage of test problems solved against the budget,
which is measured relative to the cost of the most efficient solver in the comparison.
A **higher** curve indicates a **better** solver.
See [Benchmarking Derivative-Free Optimization Algorithms](https://www.mcs.anl.gov/~wild/dfo/benchmarking)
([J. J. Moré](https://www.anl.gov/profile/jorge-j-more) and [S. M. Wild](https://www.anl.gov/profile/stefan-m-wild))
for more information.
- NEWUOA on unconstrained CUTEst problems of at most 200 variables
- BOBYQA on bound-constrained CUTEst problems of at most 200 variables
- LINCOA on linearly constrained CUTEst problems of at most 200 variables and 20000 constraints
- COBYLA on nonlinearly constrained CUTEst problems of at most 100 variables and 10000 constraints
- UOBYQA on unconstrained CUTEst problems of at most 100 variables
### Who was Powell?
[Michael James David Powell FRS](https://en.wikipedia.org/wiki/Michael_J._D._Powell) was
["a British numerical analyst who was among the pioneers of computational mathematics"](https://royalsocietypublishing.org/doi/full/10.1098/rsbm.2017.0023).
He was the inventor/early contributor of
[quasi-Newton method](https://en.wikipedia.org/wiki/Quasi-Newton_method),
[trust region method](https://en.wikipedia.org/wiki/Trust_region),
[augmented Lagrangian method](https://en.wikipedia.org/wiki/Augmented_Lagrangian_method),
and [SQP method](https://en.wikipedia.org/wiki/Sequential_quadratic_programming).
Each of them is a pillar of modern numerical optimization. He also made significant contributions
to [approximation theory and methods](https://www.cambridge.org/highereducation/books/approximation-theory-and-methods/66FD8CD6F18FE1ED499A8CA9A05F2A5A#overview).
Among numerous honors, Powell was one of the two recipients of the first
[Dantzig Prize](https://en.wikipedia.org/wiki/Dantzig_Prize)
from the Mathematical Programming Society (MOS) and Society for Industrial and Applied Mathematics (SIAM).
This is considered the highest award in optimization.
### A "fun" fact
In the past years, while working on PRIMA, I have spotted a dozen of [bugs in reputable Fortran compilers](https://github.com/zequipe/test_compiler)
and three [bugs in MATLAB](https://github.com/zequipe/test_matlab). Each of them represents days of **bitter** debugging, which finally led to the conclusion
that it was not a problem in my code but a flaw in the Fortran compilers or in MATLAB. From a very unusual angle, this reflects how intensive
the coding has been.
The bitterness behind this "fun" fact is exactly why I work on PRIMA: I hope that all
the frustrations that I have experienced will not happen to any user of Powell's methods anymore.
I hope I am the last one in the world to decode a maze of 244 GOTOs in 7939 lines of Fortran 77 code —
I did this for three years and I do not want anyone else to do it again.
### Acknowledgment
PRIMA is dedicated to the memory of the late [Professor Powell](https://www.zhangzk.net/powell.html) with gratitude for his inspiration and
for the wealth he left to us.
I am profoundly grateful to [Professor Ya-xiang Yuan](http://lsec.cc.ac.cn/~yyx) for his everlasting encouragement and support.
During the years working on PRIMA, due to the gap in my publication record, I needed a lot of
support from the optimization community and beyond.
**Thank you for help, known or unknown to me, explicit or implicit, without which I would not have survived.**
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
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).
PRIMA is a long-term project, which would not have been sustainable without the continued funds from the
[National Natural Science Foundation of China](https://www.nsfc.gov.cn/english/site_1/index.html) (NSFC),
[Hong Kong Research Grants Council](https://www.ugc.edu.hk/eng/rgc) (RGC;
ref. PolyU 253012/17P, PolyU 153054/20P, PolyU 153066/21P, and PolyU 153086/23P)
[Sun Yat-sen University](https://en.wikipedia.org/wiki/Sun_Yat-sen_University)
(particularly the [School of Mathematics](https://math.sysu.edu.cn/page/25)), and
[The Hong Kong Polytechnic University](https://www.polyu.edu.hk) (particularly the
[Department of Applied Mathematics](https://www.polyu.edu.hk/ama)).
Last but not least, I am deeply grateful to the [contributors](https://github.com/libprima/prima/graphs/contributors)
from the open-source community.
### Citing PRIMA
PRIMA has taken me significant energy and time. I will be delighted if it is useful to you. All I need is a citation / acknowledgment,
**which is crucial for the sustainability of the project, as software development is not well recognized in academia despite
[its importance](https://xkcd.com/2347/) and the significant efforts it requires**.
Note that PRIMA contains [bug fixes](#bug-fixes) and [improvements](#improvements) that do not exist in Powell's Fortran 77
implementation of the solvers. Results produced by PRIMA are surely different from Powell's original solvers,
even though the algorithms are essentially the same. Therefore,
**it is important to point out that you are using PRIMA rather than the original solvers if you want your results to be reproducible**.
It is wrong to pretend that PRIMA is just Powell's original solvers.
If you use PRIMA, please cite it as follows. The citation will be pointed to my paper on PRIMA when I finish it.
[1] Z. Zhang, PRIMA: Reference Implementation for Powell's Methods with Modernization and Amelioration,
available at https://www.libprima.net, [DOI: 10.5281/zenodo.8052654](https://doi.org/10.5281/zenodo.8052654), 2023
```bibtex
@misc{Zhang_2023,
title = {{PRIMA: Reference Implementation for Powell's Methods with Modernization and Amelioration}},
author = {Zhang, Z.},
howpublished = {available at http://www.libprima.net, DOI: 10.5281/zenodo.8052654},
year = {2023}
}
```
In addition, Powell’s methods can be cited as follows.
[2] M. J. D. Powell, A direct search optimization method that models the
objective and constraint functions by linear interpolation,
In *Advances in Optimization and Numerical Analysis*, *eds.* S. Gomez and J. P. Hennart,
pages 51--67, Springer Verlag, Dordrecht, Netherlands, 1994
[3] M. J. D. Powell, UOBYQA: unconstrained optimization by quadratic
approximation, *Math. Program.*, 92(B):555--582, 2002
[4] M. J. D. Powell, The NEWUOA software for unconstrained optimization
without derivatives, In *Large-Scale Nonlinear Optimization*, *eds.* G. Di Pillo
and M. Roma, pages 255--297, Springer, New York, US, 2006
[5] M. J. D. Powell, The BOBYQA algorithm for bound constrained
optimization without derivatives, Technical Report DAMTP 2009/NA06,
Department of Applied Mathematics and Theoretical Physics, Cambridge
University, Cambridge, UK, 2009
[6] T. M. Ragonneau and Z. Zhang,
[PDFO: a cross-platform package for Powell's derivative-free optimization solvers](https://link.springer.com/article/10.1007/s12532-024-00257-9),
*Math. Program. Comput.*, 16:535--559, 2024
**Remarks**
- LINCOA seeks the least value of a nonlinear function subject to
linear inequality constraints without using derivatives of the objective
function. Powell did not publish a paper to introduce the algorithm.
- [The paper [6]](https://link.springer.com/article/10.1007/s12532-024-00257-9) introduces [the PDFO package](https://www.pdfo.net)
rather than PRIMA. Nevertheless, it provides probably the most accessible introduction to Powell's methods.
### Charityware
PRIMA is [charityware](https://en.wikipedia.org/wiki/Careware), distributed for free under its
[license](https://github.com/libprima/prima/blob/main/LICENCE.txt).
If you appreciate it, you may consider making a donation to a charity that you trust
(in addition to [citing \& acknowledging PRIMA](https://github.com/libprima/prima#citing-prima)).
This is only a suggestion, not an obligation.
The inspiration comes from [Vim](https://www.vim.org/), with which Zaikun Zhang typed all his PRIMA code.
### Contact
In case of problems, [open a GitHub issue](https://github.com/libprima/prima/issues) or [contact
Zaikun Zhang](https://www.zhangzk.net).
### Mirrors
- Gitee: [https://gitee.com/libprima/prima](https://gitee.com/libprima/prima)
- GitHub: [https://github.com/libprima/prima](https://github.com/libprima/prima)
- GitLab: [https://gitlab.com/libprima/prima](https://gitlab.com/libprima/prima)
### Star history
[stardev](https://stardev.io/) ranking: [28 among 37,983](https://stardev.io/top/repos/fortran?developer=libprima&repo=prima) Fortran repos as of April 2025.
Thank you for your support.