dsdp 5.8-10 source package in Ubuntu

Changelog

dsdp (5.8-10) unstable; urgency=medium

  * QA upload.
  * Mark package as orphaned, see #881843.
  * d/control:
    - Bump debhelper to 7. Closes: #965498
    - Change section, extra -> optional.
    - Change Vcs-* fields, point to salsa.
    - Add Multi-Arch: foreign, to dsdp-doc package.
  * Make package build reproducible, don't install log files in *-doc package.
    Thanks to Chris Lamb. Closes: #939548
  * d/rules:
    - Make sure directory 'lib' actually exist before use.
  * Add d/gbp.conf, specify branch layout.

 -- HÃ¥vard F. Aasen <email address hidden>  Thu, 28 Jul 2022 11:20:16 +0200

Upload details

Uploaded by:
Debian QA Group
Uploaded to:
Sid
Original maintainer:
Debian QA Group
Architectures:
any all
Section:
science
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Mantic release universe science
Lunar release universe science

Downloads

File Size SHA-256 Checksum
dsdp_5.8-10.dsc 1.8 KiB 46040a9876fd3ce0c6ab5ca7e890ec45f18d19f69c45850e20bfbe25d13368fa
dsdp_5.8.orig.tar.gz 360.0 KiB de82af5e2daec70c8bf653ea4872108850bebea25238a799e78289ff88f88e06
dsdp_5.8-10.debian.tar.xz 7.1 KiB e12e9e7226bde23e85d6e563e2b3c4d53797196bbefdb50cf81a771c6dd058c3

No changes file available.

Binary packages built by this source

dsdp: 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 binaries.

dsdp-dbgsym: No summary available for dsdp-dbgsym in ubuntu kinetic.

No description available for dsdp-dbgsym in ubuntu kinetic.

dsdp-doc: 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 documentation and examples.

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

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

libdsdp-5.8gf-dbgsym: debug symbols for libdsdp-5.8gf
libdsdp-dev: No summary available for libdsdp-dev in ubuntu kinetic.

No description available for libdsdp-dev in ubuntu kinetic.