dsdp 5.8-9.1ubuntu2 source package in Ubuntu

Changelog

dsdp (5.8-9.1ubuntu2) xenial; urgency=medium

  * Cast INFO to int before storing it in the flag. LP: #1543982.

 -- Dimitri John Ledkov <email address hidden>  Thu, 14 Apr 2016 12:52:28 +0100

Upload details

Uploaded by:
Dimitri John Ledkov
Uploaded to:
Xenial
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
science
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Xenial release universe science

Downloads

File Size SHA-256 Checksum
dsdp_5.8.orig.tar.gz 360.0 KiB de82af5e2daec70c8bf653ea4872108850bebea25238a799e78289ff88f88e06
dsdp_5.8-9.1ubuntu2.debian.tar.xz 6.6 KiB a42f174cf2206ad6ecf6dcc0448521b6d3f90a6f23de0a932cbb330ad720bdeb
dsdp_5.8-9.1ubuntu2.dsc 1.7 KiB 8be1d2de61725b58d8161beea52a8a2ab9a8e65d4c5e92f79b466b89bd566e18

View changes file

Binary packages built by this source

dsdp: No summary available for dsdp in ubuntu yakkety.

No description available for dsdp in ubuntu yakkety.

dsdp-doc: No summary available for dsdp-doc in ubuntu zesty.

No description available for dsdp-doc in ubuntu zesty.

libdsdp-5.8gf: No summary available for libdsdp-5.8gf in ubuntu zesty.

No description available for libdsdp-5.8gf in ubuntu zesty.

libdsdp-dev: Software for Semidefinite Programming

 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.
 .
 This package contains the header files for developers.