SDPLIB

swMATH838MaRDI QIDQ13584

No author found.

Described by source

• SDPLIB 1.2, a library of semidefinite programming test problems

Related Items (64)

Exploiting low-rank structure in semidefinite programming by approximate operator splitting ⋮ An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path ⋮ Verification methods: Rigorous results using floating-point arithmetic ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities ⋮ A second-order cone cutting surface method: Complexity and application ⋮ A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones ⋮ An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results ⋮ Unnamed Item ⋮ On verified numerical computations in convex programming ⋮ Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions ⋮ Implementation of a primal-dual method for SDP on a shared memory parallel architecture ⋮ GMRES-Accelerated ADMM for Quadratic Objectives ⋮ A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem ⋮ A conversion of an SDP having free variables into the standard form SDP ⋮ Constraint consensus methods for finding strictly feasible points of linear matrix inequalities ⋮ Solving polynomial least squares problems via semidefinite programming relaxations ⋮ On the solution of large-scale SDP problems by the modified barrier method using iterative solvers ⋮ Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems ⋮ Curvature integrals and iteration complexities in SDP and symmetric cone programs ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ Unnamed Item ⋮ Avoiding numerical cancellation in the interior point method for solving semidefinite programs ⋮ Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming ⋮ $LDL^T$ Direction Interior Point Method for Semidefinite Programming ⋮ Generating and measuring instances of hard semidefinite programs ⋮ SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) ⋮ Algorithm 875 ⋮ COSMO: a conic operator splitting method for convex conic problems ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster ⋮ Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems ⋮ Corrigendum: Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results ⋮ An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming ⋮ An interior point method for solving semidefinite programs using cutting planes and weighted analytic centers ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) ⋮ A parallel interior point decomposition algorithm for block angular semidefinite programs ⋮ A primal-dual interior point method for nonlinear semidefinite programming ⋮ Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method ⋮ Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion ⋮ Infeasibility detection in the alternating direction method of multipliers for convex optimization ⋮ A semidefinite programming based polyhedral cut and price approach for the maxcut problem ⋮ Solving semidefinite-quadratic-linear programs using SDPT3 ⋮ A note on the calculation of step-lengths in interior-point methods for semidefinite programming ⋮ Rigorous Error Bounds for the Optimal Value in Semidefinite Programming ⋮ Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems ⋮ 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 ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ Worst-case CVaR based portfolio optimization models with applications to scenario planning ⋮ Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices ⋮ Preprocessing sparse semidefinite programs via matrix completion ⋮ Chordal decomposition in operator-splitting methods for sparse semidefinite programs ⋮ An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood ⋮ Erratum to: ``On the solution of large-scale SDP problems by the modified barrier method using iterative solvers ⋮ Computational enhancements in low-rank semidefinite programming ⋮ PENNON: A code for convex nonlinear and semidefinite programming ⋮ New stopping criteria for detecting infeasibility in conic optimization ⋮ Bregman primal-dual first-order method and application to sparse semidefinite programming ⋮ On filter-successive linearization methods for nonlinear semidefinite programming ⋮ Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem ⋮ Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem ⋮ Successive linearization methods for nonlinear semidefinite programs

This page was built for software: SDPLIB