A parallel interior point decomposition algorithm for block angular semidefinite programs
From MaRDI portal
Publication:969720
DOI10.1007/s10589-008-9187-4zbMath1189.90200OpenAlexW2057789569WikidataQ57440042 ScholiaQ57440042MaRDI QIDQ969720
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
Related Items (4)
Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints ⋮ Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems ⋮ Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems ⋮ Bias, exploitation and proxies in scenario-based risk minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Positive definite completions of partial Hermitian matrices
- Solving large-scale semidefinite programs in parallel
- Proximity control in bundle methods for convex nondifferentiable minimization
- A spectral bundle method with bounds
- First- and second-order methods for semidefinite programming
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Numerical evaluation of SBmethod
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- An aggregate subgradient method for nonsmooth convex minimization
- Preprocessing sparse semidefinite programs via matrix completion
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- A Spectral Bundle Method for Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Decomposition‐Based Interior Point Methods for Two‐Stage Stochastic Semidefinite Programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
This page was built for publication: A parallel interior point decomposition algorithm for block angular semidefinite programs
