SDPA

MaRDI QIDQ15807swMATHFDO

Official website https://sdpa.sourceforge.net/

Cited in

(only showing first 100 items - show all)

• complib
• CSDP
• Applications of semidefinite programming
• Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
• Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
• QAPLIB
• Hypatia.jl
• RAGlib
• SDPLIB
• Sdpsol
• Sostools
• Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Stronger linear programming relaxations of max-cut
• Avoiding numerical cancellation in the interior point method for solving semidefinite programs
• Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
• An independent benchmarking of SDP and SOCP solvers
• Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
• SDPHA
• MAX-2-SAT
• Ninf-G/MPI
• SeDuMi
• VSDP
• SDPT3
• The \( \mathcal{N}=2 \) superconformal bootstrap
• CVXOPT
• SparsePOP
• SDPpack
• PENNON
• GloptiPoly
• DSDP5
• Multi-scale robust design and optimization considering load uncertainties
• YALMIP
• Benchmarks for Optimization Software
• Mosek
• SPOOLES
• SDPLR
• SparseCoLO
• CirCut
• COL
• SFSDP
• reducedLP
• A matrix-based IRLS algorithm for the least \(l_p\)-norm design of 2-D FIR filters
• rMPC
• ConicBundle
• PENSDP
• MAXDET
• LMITOOL
• FIR toolbox
• Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
• NMTR
• csminwel
• Approximating the Pareto set of multiobjective linear programs via robust optimization
• lambda
• Sparsity in sums of squares of polynomials
• Parallel implementation of successive convex relaxation methods for quadratic optimization problems
• PENLAB
• PICOS
• COMPleib
• Group symmetry in interior-point methods for semidefinite program
• Flagmatic
• NCSOStools
• SpeeDP
• How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
• Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
• The tracial moment problem and trace-optimization of polynomials
• Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
• Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints
• SDPARA
• SBmethod
• NCAlgebra
• Numerical algebraic geometry and semidefinite programming
• On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
• Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
• Perturbation analysis of singular semidefinite programs and its applications to control problems
• Polyhedral approximations of the semidefinite cone and their application
• On exact Reznick, Hilbert-Artin and Putinar's representations
• Efficient semidefinite programming with approximate ADMM
• NLCertify
• Bounding the separable rank via polynomial optimization
• Sparse noncommutative polynomial optimization
• Sums of squares in Macaulay2
• Dimension reduction for semidefinite programs via Jordan algebras
• Lurupa
• A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• A non-linear arithmetic procedure for control-command software verification
• Generalized self-concordant functions: a recipe for Newton-type methods
• Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
• Computing sum of squares decompositions with rational coefficients
• Implementation of a primal-dual method for SDP on a shared memory parallel architecture
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
• Computing Gaussian \& exponential measures of semi-algebraic sets
• Loop equations and bootstrap methods in the lattice
• A sums-of-squares extension of policy iterations
• New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
• Sums of Hermitian squares decomposition of non-commutative polynomials in non-symmetric variables using NCSOStools
• BiqMac
• Bounds on linear PDEs via semidefinite optimization

This page was built for software: SDPA