A parallel interior point decomposition algorithm for block angular semidefinite programs
From MaRDI portal
(Redirected from Publication:969720)
Recommendations
- 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)
- Solving large-scale semidefinite programs in parallel
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 960151 (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
- An aggregate subgradient method for nonsmooth convex minimization
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- CSDP, A C library for semidefinite programming
- Decomposition‐Based Interior Point Methods for Two‐Stage Stochastic Semidefinite Programming
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- First- and second-order methods for semidefinite programming
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Nonlinear optimization.
- Numerical evaluation of SBmethod
- Positive definite completions of partial Hermitian matrices
- Preprocessing sparse semidefinite programs via matrix completion
- Proximity control in bundle methods for convex nondifferentiable minimization
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- SDPLIB 1.2, a library of semidefinite programming test problems
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Solving large-scale semidefinite programs in parallel
- Solving semidefinite-quadratic-linear programs using SDPT3
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(9)- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Solving large-scale semidefinite programs in parallel
- scientific article; zbMATH DE number 4139478 (Why is no real title available?)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
- 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
- Bias, exploitation and proxies in scenario-based risk minimization
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
This page was built for publication: A parallel interior point decomposition algorithm for block angular semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969720)
