Latest Developments in the SDPA Family for Solving Large-Scale SDPs
From MaRDI portal
Publication:2802543
DOI10.1007/978-1-4614-0769-0_24zbMATH Open1334.90119OpenAlexW2259408100MaRDI QIDQ2802543FDOQ2802543
Authors: Makoto Yamashita, Katsuki Fujisawa, Mituhiro Fukuda, Kazuhiro Kobayashi, Kazuhide Nakata, Maho 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
Recommendations
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- scientific article; zbMATH DE number 1174379
- An efficient approach to solve the large-scale semidefinite programming problems
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Solving semidefinite-quadratic-linear programs using SDPT3
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- A new hierarchy of SDP-relaxations for polynomial programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving large-scale semidefinite programs in parallel
- scientific article; zbMATH DE number 1489802
Semidefinite programming (90C22) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cites Work
- CSDP, A C library for semidefinite programming
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- ScaLAPACK Users' Guide
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
- Linear Matrix Inequalities in System and Control Theory
- Global optimization with polynomials and the problem of moments
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Positive definite completions of partial Hermitian matrices
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
- High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
Cited In (25)
- Formal Proofs for Nonlinear Optimization
- Analytic and numerical bootstrap for one-matrix model and ``unsolvable two-matrix model
- Semi-definite programming and quantum information
- On the maximum density of fixed strongly connected subtournaments
- Conic relaxation approaches for equal deployment problems
- 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
- Convex Relaxations of Integral Variational Problems: Pointwise Dual Relaxation and Sum-of-Squares Optimization
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- Fast certifiable algorithm for the absolute pose estimation of a camera
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Credible autocoding of convex optimization algorithms
- The density of sets avoiding distance 1 in Euclidean space
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- New and updated semidefinite programming bounds for subspace codes
- An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood
- On the Turing model complexity of interior point methods for semidefinite programming
- A tighter relaxation for the relative pose problem between cameras
- An efficient second-order cone programming approach for optimal selection in tree breeding
- Bounds on heat transport for convection driven by internal heating
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- CAMPARY: CUDA multiple precision arithmetic library and applications
- Uniqueness of codes using semidefinite programming
Uses Software
This page was built for publication: Latest Developments in the SDPA Family for Solving Large-Scale SDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802543)
