Latest Developments in the SDPA Family for Solving Large-Scale SDPs

DOI10.1007/978-1-4614-0769-0_24zbMath1334.90119OpenAlexW2259408100MaRDI QIDQ2802543

Mituhiro Fukuda, Maho Nakata, Kazuhiro Kobayashi, Makoto Yamashita, Katsuki Fujisawa, Kazuhide Nakata

Publication date: 26 April 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_24

Mathematics Subject Classification ID

Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Credible autocoding of convex optimization algorithms, A tighter relaxation for the relative pose problem between cameras, Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), New and updated semidefinite programming bounds for subspace codes, On the maximum density of fixed strongly connected subtournaments, Uniqueness of codes using semidefinite programming, On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems, Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, An efficient second-order cone programming approach for optimal selection in tree breeding, Conic relaxation approaches for equal deployment problems, An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood, CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications, On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming, Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting, Bounds on heat transport for convection driven by internal heating, Analytic and numerical bootstrap for one-matrix model and ``unsolvable two-matrix model, Formal Proofs for Nonlinear Optimization, The density of sets avoiding distance 1 in Euclidean space

Uses Software

• CSDP
• SDPLIB
• SeDuMi
• SDPT3
• SparsePOP
• YALMIP
• LBNL
• SDPARA

Cites Work

• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• Positive definite completions of partial Hermitian matrices
• Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
• Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• Multifrontal parallel distributed symmetric and unsymmetric solvers
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
• Implementation of a primal-dual method for SDP on a shared memory parallel architecture
• Global Optimization with Polynomials and the Problem of Moments
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Algorithm 925
• High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• Linear Matrix Inequalities in System and Control Theory
• ScaLAPACK Users' Guide
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• CSDP, A C library for semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• SDPLIB 1.2, a library of semidefinite programming test problems
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• An Interior-Point Method for Semidefinite Programming
• SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)