The State-of-the-Art in Conic Optimization Software

DOI10.1007/978-1-4614-0769-0_23zbMath1334.90112OpenAlexW1756100496MaRDI QIDQ2802542

Hans D. Mittelmann

Publication date: 26 April 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-0769-0_23

Mathematics Subject Classification ID

Semidefinite programming (90C22) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Real root finding for determinants of linear matrices, Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms, A guide to conic optimisation and its applications

Uses Software

• CSDP
• Matlab
• Octave
• R
• LOQO
• SDPA
• AMPL
• SeDuMi
• SDPT3
• PENNON
• DSDP5
• Benchmarks for Optimization Software
• Mosek
• SMCP
• SDPLR
• AIMMS
• GAMS
• ConicBundle
• NEOS
• Decision tree for optimization software

Cites Work

• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• Matlab
• Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
• A spectral bundle method with bounds
• On implementing a primal-dual interior-point method for conic quadratic optimization
• Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• An independent benchmarking of SDP and SOCP solvers
• Implementation of a primal-dual method for SDP on a shared memory parallel architecture
• Local minima and convergence in low-rank semidefinite programming
• A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
• Algorithm 875
• High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• CSDP, A C library for semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• A Spectral Bundle Method for Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• Semidefinite Code Bounds Based on Quadruple Distances