Solving large-scale semidefinite programs in parallel
From MaRDI portal
Publication:868469
Recommendations
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
Cites work
- scientific article; zbMATH DE number 3554030 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- A Spectral Bundle Method for Semidefinite Programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A spectral bundle method with bounds
- ARPACK Users' Guide
- An aggregate subgradient method for nonsmooth convex minimization
- An independent benchmarking of SDP and SOCP solvers
- Convex Analysis
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- Large-scale semidefinite programs in electronic structure calculation
- Local minima and convergence in low-rank semidefinite programming
- Numerical evaluation of SBmethod
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Proximity control in bundle methods for convex nondifferentiable minimization
- Semi-Definite Matrix Constraints in Optimization
- Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving some large scale semidefinite programs via the conjugate residual method
Cited in
(10)- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
- First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- High-accuracy solution of large-scale semidefinite programs
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Distributed Semidefinite Programming With Application to Large-Scale System Analysis
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
Describes a project that uses
Uses Software
This page was built for publication: Solving large-scale semidefinite programs in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868469)