SDPLIB 1.2, a library of semidefinite programming test problems
From MaRDI portal
Publication:4504799
DOI10.1080/10556789908805769zbMath0973.90522OpenAlexW2007157764MaRDI QIDQ4504799
Publication date: 14 September 2000
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789908805769
Related Items
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, CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization, 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, 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, Curvature integrals and iteration complexities in SDP and symmetric cone programs, 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, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, Generating and measuring instances of hard semidefinite programs, SDPT3 — A Matlab software package for semidefinite programming, Version 1.3, 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, 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, A parallel interior point decomposition algorithm for block angular semidefinite programs, A primal-dual interior point method for nonlinear semidefinite programming, 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, 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, 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, SDPLIB, Computational enhancements in low-rank semidefinite programming, New stopping criteria for detecting infeasibility in conic optimization, Bregman primal-dual first-order method and application to sparse 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
Uses Software
Cites Work
- Unnamed Item
- A natural generator of optimum topology of plane trusses for specified fundamental frequency
- Semidefinite programming in combinatorial optimization
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- CUTE
- Robust Truss Topology Design via Semidefinite Programming
- Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming
- CSDP, A C library for semidefinite programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
