summaryrefslogtreecommitdiff
path: root/sci-libs/nlopt/metadata.xml
diff options
context:
space:
mode:
Diffstat (limited to 'sci-libs/nlopt/metadata.xml')
-rw-r--r--sci-libs/nlopt/metadata.xml25
1 files changed, 14 insertions, 11 deletions
diff --git a/sci-libs/nlopt/metadata.xml b/sci-libs/nlopt/metadata.xml
index 2147f867cb61..17976ba280dd 100644
--- a/sci-libs/nlopt/metadata.xml
+++ b/sci-libs/nlopt/metadata.xml
@@ -6,18 +6,21 @@
<name>Gentoo Science Project</name>
</maintainer>
<longdescription lang="en">
- NLopt is a library for nonlinear optimization,
- providing a common interface for a number of different free
- optimization routines available online as well as original
- implementations of various other algorithms. Its features include:
- * Callable from variety of languages (C, C++, Fortran, Python, Octave)
- * A common interface for many different algorithms—try a different
- algorithm just by changing one parameter.
- * Both global and local optimization algorithms.
- * Both derivative-free and gradient-based optimization algorithms.
- * Algorithms for unconstrained optimization, bound-constrained
- optimization, and general nonlinear inequality constraints.
+ NLopt is a library for nonlinear optimization,
+ providing a common interface for a number of different free
+ optimization routines available online as well as original
+ implementations of various other algorithms. Its features include:
+ * Callable from variety of languages (C, C++, Fortran, Python, Octave)
+ * A common interface for many different algorithms—try a different
+ algorithm just by changing one parameter.
+ * Both global and local optimization algorithms.
+ * Both derivative-free and gradient-based optimization algorithms.
+ * Algorithms for unconstrained optimization, bound-constrained
+ optimization, and general nonlinear inequality constraints.
</longdescription>
+ <upstream>
+ <remote-id type="github">stevengj/nlopt</remote-id>
+ </upstream>
<use>
<flag name="octave">Add plugin for <pkg>sci-mathematics/octave</pkg></flag>
</use>