An independent benchmarking of SDP and SOCP solvers
From MaRDI portal
Publication:1411647
DOI10.1007/S10107-002-0355-5zbMath1030.90080OpenAlexW1993000710MaRDI QIDQ1411647
Publication date: 29 October 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0355-5
Related Items (60)
An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function ⋮ Support vector machines maximizing geometric margins for multi-class classification ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ Moments and sums of squares for polynomial optimization and related problems ⋮ Upper bound limit analysis using discontinuous quadratic displacement fields ⋮ On verified numerical computations in convex programming ⋮ Best practices for comparing optimization algorithms ⋮ Implementation of a primal-dual method for SDP on a shared memory parallel architecture ⋮ Two classes of merit functions for the second-order cone complementarity problem ⋮ A boundary point method to solve semidefinite programs ⋮ Second-order cone programming approaches to static shakedown analysis in steel plasticity ⋮ Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables ⋮ Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials ⋮ On the solution of large-scale SDP problems by the modified barrier method using iterative solvers ⋮ Solving large-scale semidefinite programs in parallel ⋮ A homotopy method for nonlinear semidefinite programming ⋮ Linear matrix inequalities in control systems with uncertainty ⋮ Facial reduction algorithms for conic optimization problems ⋮ SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances ⋮ How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization ⋮ Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion ⋮ Dimension reduction for semidefinite programs via Jordan algebras ⋮ Negativizability: a useful property for distributed state estimation and control in cyber-physical systems ⋮ On eigenvalues of symmetric matrices with PSD principal submatrices ⋮ The tracial moment problem and trace-optimization of polynomials ⋮ On vector and matrix median computation ⋮ Rigid plastic model of incremental sheet deformation using second-order cone programming ⋮ Semidefinite optimization models for limit and shakedown analysis problems involving matrix spreads ⋮ A convex relaxation bound for subgraph isomorphism ⋮ Restoration of matrix fields by second-order cone programming ⋮ Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization ⋮ A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) ⋮ PAVER 2.0: an open source environment for automated performance analysis of benchmarking data ⋮ A polynomial primal-dual affine scaling algorithm for symmetric conic optimization ⋮ Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem ⋮ A one-parametric class of merit functions for the second-order cone complementarity problem ⋮ An algebraic approach to integer portfolio problems ⋮ Application of facial reduction to H ∞ state feedback control problem ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ A robust algorithm for semidefinite programming ⋮ Semidefinite programming relaxations and algebraic optimization in control ⋮ Constrained trace-optimization of polynomials in freely noncommuting variables ⋮ Plastic collapse analysis of Mindlin-Reissner plates using a composite mixed finite element ⋮ The State-of-the-Art in Conic Optimization Software ⋮ PENNON: Software for Linear and Nonlinear Matrix Inequalities ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs ⋮ A server for automated performance analysis of benchmarking data ⋮ Loraine – an interior-point solver for low-rank semidefinite programming ⋮ Variational Methods for Denoising Matrix Fields ⋮ A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems ⋮ Computational enhancements in low-rank semidefinite programming ⋮ NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials ⋮ Adaptive XIGA shakedown analysis for problems with holes ⋮ On the robustness and scalability of semidefinite relaxation for optimal power flow problems ⋮ Second-Order Cone Representation for Convex Sets in the Plane ⋮ An unconstrained smooth minimization reformulation of the second-order cone complementarity problem ⋮ Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
Uses Software
This page was built for publication: An independent benchmarking of SDP and SOCP solvers
