{"name":"DSDP","portdir":"math/DSDP","version":"5.8","license":"Permissive","platforms":"darwin","epoch":0,"replaced_by":null,"homepage":"https://www.mcs.anl.gov/hs/software/DSDP/","description":"DSDP is a open source implementation of an interior-point method for semidefinite programming","long_description":"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","active":true,"categories":["science","math"],"maintainers":[],"variants":["atlas","octave","universal"],"dependencies":[{"type":"build","ports":["clang-9.0"]},{"type":"extract","ports":["unzip"]}],"depends_on":[{"type":"lib","ports":["py35-cvxopt","py36-cvxopt","py39-cvxopt","py37-cvxopt","py27-cvxopt","py38-cvxopt","py310-cvxopt","py311-cvxopt","py312-cvxopt","py313-cvxopt"]}]}