A conversion of an SDP having free variables into the standard form SDP
From MaRDI portal
Publication:2643612
DOI10.1007/s10589-006-9002-zzbMath1146.90492OpenAlexW2082941752MaRDI QIDQ2643612
Kazuhide Nakata, Kazuhiro Kobayashi, Kojima, Masakazu
Publication date: 27 August 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-9002-z
Related Items
Embedding methods for semidefinite programming, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Large-scale semidefinite programs in electronic structure calculation
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Symmetric indefinite systems for interior point methods
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Global Optimization with Polynomials and the Problem of Moments
- Library Automation
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- LAPACK Users' Guide
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- 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
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- An Interior-Point Method for Semidefinite Programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
