Pages that link to "Item:Q1411647"

The following pages link to An independent benchmarking of SDP and SOCP solvers (Q1411647):

Displaying 48 items.

• An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function (Q279269) (← links)
• Support vector machines maximizing geometric margins for multi-class classification (Q287612) (← links)
• Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
• Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (Q354616) (← links)
• A homotopy method for nonlinear semidefinite programming (Q360377) (← links)
• Facial reduction algorithms for conic optimization problems (Q368590) (← links)
• Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion (Q400001) (← links)
• A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
• An algebraic approach to integer portfolio problems (Q541725) (← links)
• A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
• On the robustness and scalability of semidefinite relaxation for optimal power flow problems (Q779755) (← links)
• Moments and sums of squares for polynomial optimization and related problems (Q842714) (← links)
• On verified numerical computations in convex programming (Q849186) (← links)
• Two classes of merit functions for the second-order cone complementarity problem (Q857837) (← links)
• A boundary point method to solve semidefinite programs (Q858180) (← links)
• On the solution of large-scale SDP problems by the modified barrier method using iterative solvers (Q868465) (← links)
• Solving large-scale semidefinite programs in parallel (Q868469) (← links)
• Restoration of matrix fields by second-order cone programming (Q946475) (← links)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
• A one-parametric class of merit functions for the second-order cone complementarity problem (Q967218) (← links)
• Best practices for comparing optimization algorithms (Q1642983) (← links)
• Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone (Q1785193) (← links)
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
• How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization (Q1926632) (← links)
• The tracial moment problem and trace-optimization of polynomials (Q1942272) (← links)
• Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization (Q1988893) (← links)
• Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
• Adaptive XIGA shakedown analysis for problems with holes (Q2077499) (← links)
• Dimension reduction for semidefinite programs via Jordan algebras (Q2188241) (← links)
• PAVER 2.0: an open source environment for automated performance analysis of benchmarking data (Q2250081) (← links)
• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs (Q2293657) (← links)
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
• Implementation of a primal-dual method for SDP on a shared memory parallel architecture (Q2385546) (← links)
• Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
• On vector and matrix median computation (Q2428135) (← links)
• Semidefinite optimization models for limit and shakedown analysis problems involving matrix spreads (Q2458908) (← links)
• Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem (Q2483044) (← links)
• Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem (Q2576724) (← links)
• Linear matrix inequalities in control systems with uncertainty (Q2660497) (← links)
• The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
• PENNON: Software for Linear and Nonlinear Matrix Inequalities (Q2802545) (← links)
• NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials (Q3093048) (← links)
• A server for automated performance analysis of benchmarking data (Q3377976) (← links)
• Upper bound limit analysis using discontinuous quadratic displacement fields (Q5302245) (← links)
• Negativizability: a useful property for distributed state estimation and control in cyber-physical systems (Q6073039) (← links)
• On eigenvalues of symmetric matrices with PSD principal submatrices (Q6108376) (← links)