Solving large-scale semidefinite programs in parallel
DOI10.1007/S10107-006-0032-1zbMATH Open1278.90301OpenAlexW1967327023MaRDI QIDQ868469FDOQ868469
Authors: Madhu V. Nayakkankuppam 
Publication date: 5 March 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0032-1
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
semidefinite programmingeigenvalue optimizationparallel computingLanczos methodsubgradient bundle methods
Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Semidefinite programming (90C22)
Cites Work
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Implicit Application of Polynomial Filters in a k-Step Arnoldi Method
- ARPACK Users' Guide
- Numerical evaluation of SBmethod
- A Spectral Bundle Method for Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Convex Analysis
- A spectral bundle method with bounds
- An aggregate subgradient method for nonsmooth convex minimization
- Title not available (Why is that?)
- Proximity control in bundle methods for convex nondifferentiable minimization
- Local minima and convergence in low-rank semidefinite programming
- Sensitivity analysis of all eigenvalues of a symmetric matrix
- An independent benchmarking of SDP and SOCP solvers
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Solving some large scale semidefinite programs via the conjugate residual method
- Title not available (Why is that?)
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Semi-Definite Matrix Constraints in Optimization
- Large-scale semidefinite programs in electronic structure calculation
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
Cited In (8)
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules
- High-accuracy solution of large-scale semidefinite programs
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Distributed Semidefinite Programming With Application to Large-Scale System Analysis
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
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)
