A parallel interior point decomposition algorithm for block angular semidefinite programs
From MaRDI portal
Publication:969720
DOI10.1007/S10589-008-9187-4zbMATH Open1189.90200DBLPjournals/coap/Sivaramakrishnan10OpenAlexW2057789569WikidataQ57440042 ScholiaQ57440042MaRDI QIDQ969720FDOQ969720
Kartik Krishnan Sivaramakrishnan
Publication date: 7 May 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9187-4
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
- CSDP, A C library for semidefinite programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- Numerical evaluation of SBmethod
- Solving semidefinite-quadratic-linear programs using SDPT3
- A Spectral Bundle Method for Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- A spectral bundle method with bounds
- An aggregate subgradient method for nonsmooth convex minimization
- Nonlinear optimization.
- Proximity control in bundle methods for convex nondifferentiable minimization
- Title not available (Why is that?)
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Positive definite completions of partial Hermitian matrices
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Decomposition‐Based Interior Point Methods for Two‐Stage Stochastic Semidefinite Programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
- First- and second-order methods for semidefinite programming
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Solving large-scale semidefinite programs in parallel
- Preprocessing sparse semidefinite programs via matrix completion
Cited In (7)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- Solving large-scale semidefinite programs in parallel
- Title not available (Why is that?)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
- Bias, exploitation and proxies in scenario-based risk minimization
Uses Software
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)
