Cited in
(24)- A new approximation hierarchy for polynomial conic optimization
- Abstract interpretation meets convex optimization
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Large-scale semidefinite programs in electronic structure calculation
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- scientific article; zbMATH DE number 6135091 (Why is no real title available?)
- Solving large-scale semidefinite programs in parallel
- SDPLIB
- Ninf-G/MPI
- lambda
- NETAL
- SBmethod
- Ncpol2sdpa
- pPCx
- Sparse-BSOS
- SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization)
- Preprocessing sparse semidefinite programs via matrix completion
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Could we use a million cores to solve an integer program?
- Stability and performance verification of optimization-based controllers
- Exploiting equalities in polynomial programming
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
This page was built for software: SDPARA
