debian/0000755000000000000000000000000011760504102007162 5ustar debian/libdsdp-dev.install0000644000000000000000000000011710656411671012761 0ustar lib/libdsdp.a lib/libdsdp.so usr/lib include/*.h src/sdp/*.h usr/include/dsdp debian/source/0000755000000000000000000000000011612224743010470 5ustar debian/source/format0000644000000000000000000000001411612220770011672 0ustar 3.0 (quilt) debian/rules0000755000000000000000000000177111760475541010266 0ustar #!/usr/bin/make -f include /usr/share/cdbs/1/rules/debhelper.mk DEB_SHLIBDEPS_INCLUDE := /usr/lib/atlas ver := $(DEB_UPSTREAM_VERSION) soname := libdsdp-$(ver)gf.so common-build-arch:: debian/build-arch-stamp debian/build-arch-stamp: $(MAKE) DSDPROOT=`pwd` OPTFLAGS="-fPIC -O3" dsdpapi LAPACKBLAS="-llapack \ -lblas -lm" cd lib && ar x libdsdp.a && \ $(CC) -shared -Wl,--no-add-needed,-soname=$(soname) -o $(soname) *.o \ -llapack -lblas -lm && ln -s $(soname) libdsdp.so && rm *.o $(MAKE) DSDPROOT=`pwd` -C examples clean $(MAKE) DSDPROOT=`pwd` OPTFLAGS="-O3" DSDPLIB="-L$(CURDIR)/lib -ldsdp -lm" \ example LAPACKBLAS="" touch $@ clean:: $(MAKE) clean $(RM) debian/build-arch-stamp debian/build-indep-stamp $(RM) docs/dox/docwarnings bin/results-dsdp* $(RM) -r docs/dox/html common-build-indep:: debian/build-indep-stamp debian/build-indep-stamp: cd docs/dox && doxygen touch $@ get-orig-source: uscan --rename --upstream-version 0 || true @echo successfully retrieved upstream tarball debian/watch0000644000000000000000000000014010655155354010223 0ustar version=3 http://www-unix.mcs.anl.gov/DSDP/DSDP([0-9]*.[0-9]*).tar.gz debian debian/orig-tar.sh debian/orig-tar.sh0000755000000000000000000000061310656403767011267 0ustar #!/bin/sh # called by uscan with '--upstream-version' tar xf $3 --exclude '*.pdf' unzip DSDP$2/docs/DSDP5-api-html.zip rm -rf dox/html dox/images DSDP$2/docs/DSDP5-api-html.zip mv dox DSDP$2/docs/dox tar czf $3 DSDP${2} rm -rf DSDP$2 # move to directory 'tarballs' if [ -r .svn/deb-layout ]; then . .svn/deb-layout mv $3 $origDir echo "moved $3 to $origDir" fi exit 0 debian/control0000644000000000000000000001141411612223320010562 0ustar Source: dsdp Section: science Priority: extra Maintainer: Soeren Sonnenburg Build-Depends: cdbs, debhelper (>= 5), gfortran, libblas-dev, liblapack-dev, doxygen, doxygen-latex Standards-Version: 3.9.2 Homepage: http://www-unix.mcs.anl.gov/DSDP/ Vcs-Svn: https://bollin.googlecode.com/svn/dsdp/trunk/ Vcs-Browser: http://bollin.googlecode.com/svn/dsdp/trunk/ Package: dsdp Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends} Description: 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. Package: dsdp-doc Architecture: all Depends: ${misc:Depends} Recommends: dsdp Section: doc Description: 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. Package: libdsdp-dev Section: libdevel Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends}, libdsdp-5.8gf (= ${binary:Version}) Description: 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. Package: libdsdp-5.8gf Section: libs Architecture: any Depends: ${shlibs:Depends}, ${misc:Depends} Description: 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 library files. debian/dsdp.links0000644000000000000000000000017510655663004011172 0ustar /usr/share/man/man1/dsdp5.1.gz /usr/share/man/man1/maxcut.1.gz /usr/share/man/man1/dsdp5.1.gz /usr/share/man/man1/theta.1.gz debian/dsdp-doc.docs0000644000000000000000000000001610656403767011550 0ustar docs/dox/html debian/copyright0000644000000000000000000000526011612220440011114 0ustar This package was debianized by Soeren Sonnenburg on Wed, 01 Aug 2007 22:58:57 +0200. It was downloaded from Upstream Authors: Steven J. Benson Mathematics and Computer Science Division Argonne National Laboratory Argonne IL 60439 Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA U.S.A Copyright: (C) COPYRIGHT 2004 UNIVERSITY OF CHICAGO License: COPYRIGHT NOTIFICATION (C) COPYRIGHT 2004 UNIVERSITY OF CHICAGO This program discloses material protectable under copyright laws of the United States. Permission to copy and modify this software and its documentation is hereby granted, provided that this notice is retained thereon and on all copies or modifications. The University of Chicago makes no representations as to the suitability and operability of this software for any purpose. It is provided "as is"; without express or implied warranty. Permission is hereby granted to use, reproduce, prepare derivative works, and to redistribute to others, so long as this original copyright notice is retained. Any publication resulting from research that made use of this software should cite this document. Argonne National Laboratory with facilities in the states of Illinois and Idaho, is owned by The United States Government, and operated by the University of Chicago under provision of a contract with the Department of Energy. DISCLAIMER THIS PROGRAM WAS PREPARED AS AN ACCOUNT OF WORK SPONSORED BY AN AGENCY OF THE UNITED STATES GOVERNMENT. NEITHER THE UNITED STATES GOVERNMENT NOR ANY AGENCY THEREOF, NOR THE UNIVERSITY OF CHICAGO, NOR ANY OF THEIR EMPLOYEES OR OFFICERS, MAKES ANY WARRANTY, EXPRESS OR IMPLIED, OR ASSUMES ANY LEGAL LIABILITY OR RESPONSIBILITY FOR THE ACCURACY, COMPLETENESS, OR USEFULNESS OF ANY INFORMATION, APPARATUS, PRODUCT, OR PROCESS DISCLOSED, OR REPRESENTS THAT ITS USE WOULD NOT INFRINGE PRIVATELY OWNED RIGHTS. REFERENCE HEREIN TO ANY SPECIFIC COMMERCIAL PRODUCT, PROCESS, OR SERVICE BY TRADE NAME, TRADEMARK, MANUFACTURER, OR OTHERWISE, DOES NOT NECESSARILY CONSTITUTE OR IMPLY ITS ENDORSEMENT, RECOMMENDATION, OR FAVORING BY THE UNITED STATES GOVERNMENT OR ANY AGENCY THEREOF. THE VIEW AND OPINIONS OF AUTHORS EXPRESSED HEREIN DO NOT NECESSARILY STATE OR REFLECT THOSE OF THE UNITED STATES GOVERNMENT OR ANY AGENCY THEREOF. The Debian packaging is (C) 2007-2011, Soeren Sonnenburg and is licensed under the GPL, see `/usr/share/common-licenses/GPL'. debian/dsdp.install0000644000000000000000000000005010656411671011512 0ustar bin/dsdp5 bin/maxcut bin/theta usr/bin debian/compat0000644000000000000000000000000210655140006010361 0ustar 5 debian/dsdp.docs0000644000000000000000000000000710655313036010771 0ustar Readme debian/README.Debian0000644000000000000000000000071711063137022011227 0ustar dsdp for Debian --------------- The matlab related files (documentation, examples) are not installed. Furthermore the precompiled documentations files were removed. They are available online under the following urls: http://www-unix.mcs.anl.gov/DSDP/DSDP5-API-UserGuide.pdf http://www-unix.mcs.anl.gov/DSDP/DSDP5-Exe-UserGuide.pdf http://www-unix.mcs.anl.gov/DSDP/DSDP5-P1289-0905.pdf -- Soeren Sonnenburg Wed, 01 Aug 2007 22:58:57 +0200 debian/libdsdp-5.8gf.install0000644000000000000000000000003210753127627013031 0ustar lib/libdsdp-*.so usr/lib debian/dsdp.manpages0000644000000000000000000000001710655320063011633 0ustar debian/dsdp5.1 debian/dsdp-doc.examples0000644000000000000000000000017510655313036012430 0ustar examples/Contents examples/color.c examples/dsdp.c examples/maxcut.c examples/readsdpa.c examples/stable.c examples/theta.c debian/changelog0000644000000000000000000000523011760504065011044 0ustar dsdp (5.8-9.1) unstable; urgency=low * Non-maintainer upload. * debian/rules: Separate build-arch and build-indep targets so that directly invoking binary-arch behaves as expected. Closes: #666310. -- Matej Vela Sun, 27 May 2012 21:01:56 +0100 dsdp (5.8-9) unstable; urgency=low * Bump Standards Version to 3.9.2 (no changes required). * Switch to dpkg-source 3.0 (quilt) format. * Include misc-depends to fix lintian warnings. * Replace doxygen and texlive-* build dependencies with doxygen-latex (Closes: #616210). -- Soeren Sonnenburg Fri, 22 Jul 2011 09:08:09 +0200 dsdp (5.8-8) unstable; urgency=low [ Torsten Werner ] * Remove myself from Uploaders as discussed with Sören [ Soeren Sonnenburg ] * Add -lm -lblas to linkflags (Closes: #554307). * Bump Standards Version to 3.8.3 (no changes required). -- Soeren Sonnenburg Wed, 11 Nov 2009 21:34:22 +0100 dsdp (5.8-7) unstable; urgency=low * Version dependency on debhelper (>=5). * Fix hyphen in manpage. -- Soeren Sonnenburg Tue, 23 Sep 2008 20:06:09 +0200 dsdp (5.8-6) unstable; urgency=low * Build depend on ghostscript not obsolete gs-gpl (fixes lintian error). * Update my email address to sonne@debian.org. * Bump Standards Version to 3.8.0 (no changes required) -- Soeren Sonnenburg Sun, 14 Sep 2008 09:33:16 +0200 dsdp (5.8-5) unstable; urgency=low * Use Science/Mathematics as doc-base section. -- Soeren Sonnenburg Wed, 21 May 2008 21:18:35 +0200 dsdp (5.8-4) unstable; urgency=low [ Soeren Sonnenburg ] * Adjust Build-Depends for gfortran transition (Closes: #463947) * Fix typo in package description (Closes: Bug#464213) [ Torsten Werner ] * Rename package libdsdp-5.8 to libdsdp-5.8gf. * Change Build-Depends: libg2c0-dev to gfortran. * Add LAPACKBLAS="-llapack" to make arguments. * Add suffix 'gf' to soname. * Link shared library with all needed libraries. -- Torsten Werner Fri, 08 Feb 2008 22:14:59 +0100 dsdp (5.8-3) unstable; urgency=low * Bump Standards-Version to 3.7.3 -- Soeren Sonnenburg Wed, 02 Jan 2008 19:23:31 +0100 dsdp (5.8-2) unstable; urgency=low [ Soeren Sonnenburg ] * Fix double builds (Closes: #442546) * Fix section for doc package [ Torsten Werner ] * Add Build-Depends: gs-gpl, texlive-latex-base. * Fix some lintian warnings. -- Torsten Werner Wed, 19 Sep 2007 19:35:07 +0200 dsdp (5.8-1) unstable; urgency=low * Initial release (Closes: #436069) -- Soeren Sonnenburg Wed, 01 Aug 2007 22:58:57 +0200 debian/dsdp-doc.doc-base0000644000000000000000000000220511015072773012264 0ustar Document: dsdp Title: Software for Semidefinite Programming Author: Steven J. Benson, Yinyu Ye Abstract: 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. Section: Science/Mathematics Format: HTML Index: /usr/share/doc/dsdp-doc/html/index.html Files: /usr/share/doc/dsdp-doc/html/*.html debian/dsdp5.10000644000000000000000000000703211066227717010302 0ustar .\" Hey, EMACS: -*- nroff -*- .\" First parameter, NAME, should be all caps .\" Second parameter, SECTION, should be 1-8, maybe w/ subsection .\" other parameters are allowed: see man(7), man(1) .TH DSDP 1 "August 1, 2007" .\" Please adjust this date whenever revising the manpage. .\" .\" Some roff macros, for reference: .\" .nh disable hyphenation .\" .hy enable hyphenation .\" .ad l left justify .\" .ad b justify to both left and right margins .\" .nf disable filling .\" .fi enable filling .\" .br insert line break .\" .sp insert n+1 empty lines .\" for manpage-specific macros, see man(7) .SH NAME dsdp5 \- semidefinite program solver .SH SYNOPSIS .B dsdp5 .RI [ options ] " filename" .br .B maxcut .RI [ options ] " filename" .br .B theta .RI " filename" .br .SH DESCRIPTION This manual page documents briefly the .B dsdp5, .B theta and .B maxcut commands. .PP .\" TeX users may be more comfortable with the \fB\fP and .\" \fI\fP escape sequences to invode bold face and italics, .\" respectively. \fBdsdp5\fP -- interface to solve general semi-definite programs .br \fBmaxcut\fP -- solves a SDP relaxation of the maximum cut problem .br \fBtheta\fP -- solves the Lovasz thetha problem .SH OPTIONS A summary of options is included below. For a complete description, see .B /usr/share/doc/dsdp-doc. .TP .B \-help Show summary of options. .TP .B \-v, \-\-version Show version of program. .TP .B \-print print information at each k iteration (default 10) .TP .B \-save filename of solution file in SDPA format .TP .B \-fout filename to print standard monitor to a file .TP .B \-y0 filename for initial solution file .TP .B \-benchmark filename to file containing names of SDPA files .TP .B \-directory path to directory containing benchmark SDPA files .TP .B \-suffix suffix to add to each benchmark problem name .TP .B \-dloginfo print more information for higher numbers (default 0) .TP .B \-dlogsummary print timing information (default 1 \- enabled) .TP .B \-gaptol gap tolerance parameter, stop when relative duality gap less than this gap (default 1e-6) .TP .B \-r0 if nonnegative, initialize S by adding this multiple of the identity matrix (default \-1) .TP .B \-penalty penalize dual infeasibility (default 1e10) .TP .B \-boundy bound for variables y (default 1e7) .TP .B \-maxit set maximum iterates (default 200) .TP .B \-zbar Upper bound for dual solution (default 1e10) .TP .B \-mu0 if positive, set initial barrier parameter (default \-1) .TP .B \-rho Potential parameter as multiple of dimension (default 3) .TP .B \-drho Use dynamic rho strategy (default 1) .TP .B \-pnormtol stop only if pnorm less than (default 1e30) .TP .B \-reuse Reuse the Schur Matrix this many times (default 4) .TP .B -dobjmin apply a known lower bound for the objective at solution as a constraint. .TP .B -bigM if positive, modify algorithm to make dual infeasibility positive with a large associated cost (default 0) .TP .B \-dloginfo print more information for higher numbers (default 0) .TP .B \-params filename to read selected options from a file .br .SH SEE ALSO .BR glpsol (1), .TP The programs are documented fully in the accompanying .pdf and html documentation which can be found in .B /usr/share/doc/dsdp-doc if the dsdp-doc package is installed. .SH AUTHOR dsdp was written by Steven J. Benson and Yinyu Ye .PP This manual page was written by Soeren Sonnenburg , for the Debian project (but may be used by others).