DSDP (math/DSDP) Add to my watchlist

DSDP is a open source implementation of an interior-point method for semidefinite programming

DSDP 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. The dual-scaling algorithm implemented in this package has a convergence proof and worst-case polynomial complexity under mild assumptions on the data

Version: 5.8 License: Permissive GitHub
Reset

17 build(s) found
Builder Build Number Start Time Elapsed Time Watcher Build Status
15.arm64 5258 2025-03-02 17:42:28 0:00:16 1581 build successful
15 10131 2024-10-11 4:55:36 0:00:21 904 build successful
14.arm64 4467 2024-01-14 14:32:50 0:00:20 1883 build successful
14 12713 2023-11-23 5:51:11 0:03:23 2009 build successful
13.arm64 4091 2023-02-28 17:04:58 0:00:11 1866 build successful
13 5704 2022-12-23 14:52:50 0:00:53 910 build successful
12 7133 2021-12-22 14:15:28 0:00:34 1962 build successful
12.arm64 12379 2021-11-12 17:05:58 0:00:15 913 build successful
11 11569 2021-01-02 14:43:51 0:00:49 1556 build successful
11.arm64 6988 2021-01-02 12:54:47 0:00:28 1653 build successful
10.5_ppc 95122 2019-03-12 21:00:05 0:02:44 22132 build successful
10.12 86591 2019-03-12 20:27:31 0:01:16 21842 build successful
10.10 81798 2019-03-12 20:19:54 0:01:27 22897 build successful
10.13 51831 2019-03-12 19:58:42 0:01:35 13818 build successful
10.11 81303 2019-03-12 19:51:51 0:01:22 22849 build successful
10.14 25808 2019-03-12 19:43:51 0:01:25 4528 build successful
10.9 83736 2019-03-12 19:36:22 0:00:54 22842 build successful