aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat (limited to 'sci-libs/optpp/metadata.xml')
-rw-r--r--sci-libs/optpp/metadata.xml24
1 files changed, 12 insertions, 12 deletions
diff --git a/sci-libs/optpp/metadata.xml b/sci-libs/optpp/metadata.xml
index d7fee3da5..afc414a95 100644
--- a/sci-libs/optpp/metadata.xml
+++ b/sci-libs/optpp/metadata.xml
@@ -6,17 +6,17 @@
<name>Gentoo Science Project</name>
</maintainer>
<longdescription lang="en">
- OPT++ is a library of nonlinear optimization algorithms written in
- C++. The motivation for this package is to build an environment for
- the rapid prototyping and development of new optimization
- algorithms. In particular, the focus is on robust and efficient
- algorithms for problems in which the function and constraint
- evaluations require the execution of an expensive computer
- simulation. Currently, OPT++ includes the classic Newton methods, a
- nonlinear interior-point method, parallel direct search, generating
- set search, a trust region - parallel direct search hybrid, and a
- wrapper to NPSOL. Between these methods, a wide range of problems
- can be solved, e.g. with or without constraints, with or without
- analytic gradients, simulation based, etc.
+OPT++ is a library of nonlinear optimization algorithms written in
+C++. The motivation for this package is to build an environment for
+the rapid prototyping and development of new optimization
+algorithms. In particular, the focus is on robust and efficient
+algorithms for problems in which the function and constraint
+evaluations require the execution of an expensive computer
+simulation. Currently, OPT++ includes the classic Newton methods, a
+nonlinear interior-point method, parallel direct search, generating
+set search, a trust region - parallel direct search hybrid, and a
+wrapper to NPSOL. Between these methods, a wide range of problems
+can be solved, e.g. with or without constraints, with or without
+analytic gradients, simulation based, etc.
</longdescription>
</pkgmetadata>