The following pages link to SDPARA (Q19724):
Displaying 16 items.
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Stability and performance verification of optimization-based controllers (Q518285) (← links)
- Large-scale semidefinite programs in electronic structure calculation (Q868461) (← links)
- Solving large-scale semidefinite programs in parallel (Q868469) (← links)
- Exploiting equalities in polynomial programming (Q935230) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Could we use a million cores to solve an integer program? (Q1935943) (← links)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture (Q2385546) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs (Q2802543) (← links)
- Algorithm 950: Ncpol2sdpa -- sparse semidefinite programming relaxations for polynomial optimization problems of noncommuting variables (Q2828144) (← links)
- Preprocessing sparse semidefinite programs via matrix completion (Q3377970) (← links)
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster (Q3562409) (← links)
- SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization) (Q4671022) (← links)
- (Q4906149) (← links)
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385033) (← links)
