Infeasible and weakly infeasible SDPs from Liu-Pataki
This page contains problem instances generated in the paper
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming , M. Liu, G. Pataki, Mathematical Programming, series A, volume 167, pages 435–480(2018) DOI
The weakly infeasible, messy instances are the hardest.
To make using these instances easier, here is
The instances (in Sedumi format, in zip files) are here:
- Infeasible, clean, n=10, m=10
- Infeasible, clean, n=10, m=20
- Infeasible, messy, n=10, m=10
- Infeasible, messy, n=10, m=20
- Weakly infeasible, clean, n=10, m=10
- Weakly infeasible, clean, n=10, m=20
- Weakly infeasible, messy, n=10, m=10
- Weakly infeasible, messy, n=10, m=20
- The whole library in a zip file
Feel free to send me comments, suggestions, or email me if you find any broken links.