Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
From MaRDI portal
Publication:4664050
DOI10.1080/1055678031000118482zbMath1106.90366OpenAlexW2090084096MaRDI QIDQ4664050
Kojima, Masakazu, Makoto Yamashita, Katsuki Fujisawa
Publication date: 5 April 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/1055678031000118482
Semidefinite programming (90C22) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
A Single Entangled System Is an Unbounded Source of Nonlocal Correlations and of Certified Random Numbers, Analysis of Linear Partial Differential Equations Using Convex Optimization, Bounding the separable rank via polynomial optimization, Efficient sampling in spectrahedra and volume approximation, Sparse noncommutative polynomial optimization, Solving Natural Conic Formulations with Hypatia.jl, Conic mixed-integer rounding cuts, Finding graph embeddings by incremental low-rank semidefinite programming, On verified numerical computations in convex programming, Semidefinite programming for uncertain linear equations in static analysis of structures, Implementation of a primal-dual method for SDP on a shared memory parallel architecture, A conversion of an SDP having free variables into the standard form SDP, On the estimation of robustness and filtering ability of dynamic biochemical networks under process delays, internal parametric perturbations and external disturbances, Loop equations and bootstrap methods in the lattice, Sums of squares in Macaulay2, Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools, A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion, Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones, An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs, Performance enhancements for a generic conic interior point algorithm, A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming, The tracial moment problem and trace-optimization of polynomials, Abstract interpretation meets convex optimization, Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations, A framework for solving mixed-integer semidefinite programs, Complete solution for unambiguous discrimination of three pure states with real inner products, Interior Point Methods for Nonlinear Optimization, On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems, Application of facial reduction to H ∞ state feedback control problem, Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods, Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise, Preprocessing and Regularization for Degenerate Semidefinite Programs, Sparsity in sums of squares of polynomials, Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons, Polyhedral approximations of the semidefinite cone and their application, Constrained trace-optimization of polynomials in freely noncommuting variables, A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming, Latest Developments in the SDPA Family for Solving Large-Scale SDPs, On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0, Preprocessing sparse semidefinite programs via matrix completion, Conic relaxation approaches for equal deployment problems, A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems, SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0), Computational enhancements in low-rank semidefinite programming, NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials, Efficient semidefinite programming with approximate ADMM, A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming, Generalized self-concordant functions: a recipe for Newton-type methods, Low-rank exploitation in semidefinite programming for control, Semidefinite programming based approaches to the break minimization problem, Sampling method for semidefinite programmes with non-negative Popov function constraints
Uses Software
