SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

DOI10.15807/JORSJ.50.278zbMath1142.90465OpenAlexW2185208689MaRDI QIDQ5385033

Mituhiro Fukuda, Kazuhide Nakata, Makoto Yamashita, Katsuki Fujisawa

Publication date: 29 April 2008

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.50.278

zbMATH Keywords

optimizationparallel computinggrid computingsemidefinite programprimal-dual interior-point method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Large-scale problems in mathematical programming (90C06) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (8)

An optimal approach for the critical node problem using semidefinite programming ⋮ Relaxation methods for navigation satellites set optimization ⋮ Link removal for the control of stochastically evolving epidemics over networks: a comparison of approaches ⋮ Optimal link removal for epidemic mitigation: A two-way partitioning approach ⋮ Polynomial optimization for water networks: global solutions for the valve setting problem ⋮ Exact correlators of BPS operators from the 3d superconformal bootstrap ⋮ Latest Developments in the SDPA Family for Solving Large-Scale SDPs ⋮ Constraints on 2d CFT partition functions

Uses Software

• Unnamed Item
• Unnamed Item
• Unnamed Item
• SDPA
• Ninf-G/MPI
• SeDuMi
• PENNON
• SDPLR
• SDPARA

This page was built for publication: SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)