SDPARA
From MaRDI portal
Software:19724
swMATH7707MaRDI QIDQ19724FDOQ19724
Author name not available (Why is that?)
Cited In (16)
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables
- Exploiting equalities in polynomial programming
- SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization)
- Abstract interpretation meets convex optimization
- Could we use a million cores to solve an integer program?
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Solving large-scale semidefinite programs in parallel
- 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)
- Preprocessing sparse semidefinite programs via matrix completion
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
- A new approximation hierarchy for polynomial conic optimization
- Stability and performance verification of optimization-based controllers
- Title not available (Why is that?)
This page was built for software: SDPARA
