diff options
author | V3n3RiX <venerix@redcorelinux.org> | 2017-10-09 18:53:29 +0100 |
---|---|---|
committer | V3n3RiX <venerix@redcorelinux.org> | 2017-10-09 18:53:29 +0100 |
commit | 4f2d7949f03e1c198bc888f2d05f421d35c57e21 (patch) | |
tree | ba5f07bf3f9d22d82e54a462313f5d244036c768 /sci-libs/dsdp/metadata.xml |
reinit the tree, so we can have metadata
Diffstat (limited to 'sci-libs/dsdp/metadata.xml')
-rw-r--r-- | sci-libs/dsdp/metadata.xml | 24 |
1 files changed, 24 insertions, 0 deletions
diff --git a/sci-libs/dsdp/metadata.xml b/sci-libs/dsdp/metadata.xml new file mode 100644 index 000000000000..c7207ec72d72 --- /dev/null +++ b/sci-libs/dsdp/metadata.xml @@ -0,0 +1,24 @@ +<?xml version="1.0" encoding="UTF-8"?> +<!DOCTYPE pkgmetadata SYSTEM "http://www.gentoo.org/dtd/metadata.dtd"> +<pkgmetadata> + <maintainer type="project"> + <email>sci@gentoo.org</email> + <name>Gentoo Science Project</name> + </maintainer> + <longdescription lang="en"> + The DSDP software is a free open source implementation of an + interior-point method for semidefinite programming. It provides + primal and dual solutions, exploits low-rank structure and sparsity + in the data, and has relatively low memory requirements for an + interior-point method. It allows feasible and infeasible starting + points and provides approximate certificates of infeasibility when + no feasible solution exists. The dual-scaling algorithm implemented + in this package has a convergence proof and worst-case polynomial + complexity under mild assumptions on the data. Furthermore, the + solver offers scalable parallel performance for large problems and a + well documented interface. Some of the most popular applications of + semidefinite programming and linear matrix inequalities (LMI) are + model control, truss topology design, and semidefinite relaxations + of combinatorial and global optimization problems. +</longdescription> +</pkgmetadata> |