Dataset Viewer
Auto-converted to Parquet Duplicate
schema_version
int64
1
1
id
stringlengths
12
73
title
stringlengths
8
106
category
stringclasses
1 value
description
stringlengths
26
1.09k
tags
listlengths
1
12
provenance_kind
stringclasses
3 values
source_id
stringclasses
827 values
citation
stringlengths
33
555
source_url
stringlengths
22
218
license
stringclasses
267 values
expected_status
stringclasses
6 values
expected_objective
float64
-1,334,294,490.83
10.6B
⌀
expected_absolute_tolerance
float64
0
20
⌀
expected_relative_tolerance
float64
0
0.02
⌀
solution_solver
stringclasses
1 value
solution_status
stringclasses
4 values
solution_objective
float64
-1,334,294,496.38
50.6M
⌀
solution_solve_time
float64
0
323
⌀
solution_date
stringdate
2026-09-17 00:00:00
2026-10-14 00:00:00
⌀
model_path
stringlengths
28
89
sidecar_path
stringlengths
20
81
model_size_bytes
int64
341
25.6M
model_sha256
stringlengths
64
64
1
sdp/aaronmqs_tvd_delay_independent_analysis
Aaron TVD fixed delay-independent analysis LMI
sdp
Finite delay-independent stability SDP with fixed A0, A1, and K, the two state matrices, and a 4-by-4 block LMI.
[ "continuous", "sdp", "semidefinite", "control", "time-delay", "source-alternative" ]
imported
aaronmqs-tvd
Aaron Marques, TVD repository, LMI Approach/Delay Independent Stability/delayIndependent_analysis.m, commit c8d2c6741d04700216e9f97665c21ec786f9090d.
https://github.com/aaronmqs/TVD/blob/c8d2c6741d04700216e9f97665c21ec786f9090d/LMI%20Approach/Delay%20Independent%20Stability/delayIndependent_analysis.m
MIT
optimal
null
null
null
Mosek 11.2.4
optimal
null
0.000632
2026-09-23
h00-1f/aaronmqs_tvd_delay_independent_analysis.mof.json
h00-1f/aaronmqs_tvd_delay_independent_analysis.yaml
2,490
71c4dfd8019374c7d4a4555e201a2f76ccf9fb987130c4a133bec294e189aca9
1
sdp/abate_acc2020_mlf_order10
Abate ACC2020 switched-system Meta-Lyapunov SDP (order 10)
sdp
Order-10 homogeneous polynomial Meta-Lyapunov SDP for the switched-system modes in Abate et al., ACC 2020. Its lifted vector is [x1^5, x1^4*x2, ..., x2^5] of dimension 6; it imposes P >= I and negative-semidefinite Lyapunov inequalities for both modes.
[ "continuous", "control", "lyapunov", "polynomial", "semidefinite", "switched-system" ]
imported
abate-acc2020-polynomial-lyapunov
Matthew Abate, Corbin Klett, Samuel Coogan, and Eric Feron, Lyapunov Differential Hierarchy and Polynomial Lyapunov Functions for Switched Linear Systems, 2020 American Control Conference artifact, MLF_Case_Study.m.
https://github.com/gtfactslab/Abate_ACC2020/blob/07702a1e3857151b0b916e8a4d8d9340e27b5bfc/MLF_Case_Study.m
unknown (no license file at the pinned artifact commit)
optimal
3.027393
0.000001
0.000001
Mosek 11.2.4
optimal
3.027393
0.003961
2026-09-23
hc0-df/abate_acc2020_mlf_order10.mof.json.zst
hc0-df/abate_acc2020_mlf_order10.yaml
1,046
d4bae923ede77706104f7004a404e2f986d2c5e58f7497ee14b834b6e0d6e4cc
1
sdp/abate_acc2020_mlf_order16
Abate ACC2020 switched-system Meta-Lyapunov SDP (order 16)
sdp
Order-16 homogeneous polynomial Meta-Lyapunov SDP from Abate et al., ACC 2020. Its lifted vector is [x1^8, x1^7*x2, ..., x2^8] (dimension 9); it imposes P >= I and negative-semidefinite Lyapunov inequalities for both switched-system modes.
[ "continuous", "control", "lyapunov", "polynomial", "semidefinite", "switched-system" ]
imported
abate-acc2020-polynomial-lyapunov
Matthew Abate, Corbin Klett, Samuel Coogan, and Eric Feron, Lyapunov Differential Hierarchy and Polynomial Lyapunov Functions for Switched Linear Systems, 2020 American Control Conference artifact, MLF_Case_Study.m.
https://github.com/gtfactslab/Abate_ACC2020/blob/07702a1e3857151b0b916e8a4d8d9340e27b5bfc/MLF_Case_Study.m
unknown (no license file at the pinned artifact commit)
unknown
null
null
null
null
null
null
null
null
h80-9f/abate_acc2020_mlf_order16.mof.json.zst
h80-9f/abate_acc2020_mlf_order16.yaml
1,888
c4ca94d1e97c90d03f45cd5ae6affc7c1f48c10f119df7c44ad059e96a7e8f51
1
sdp/abate_acc2020_mlf_order2
Abate ACC2020 switched-system Meta-Lyapunov SDP (order 2)
sdp
The explicit c=1 (order-two) Meta-Lyapunov semidefinite program from the Abate et al. ACC 2020 MATLAB artifact. It uses the two published switched-system matrices, P >= I, and negative semidefinite Lyapunov inequalities for both modes.
[ "continuous", "control", "lyapunov", "semidefinite", "switched-system" ]
imported
abate-acc2020-polynomial-lyapunov
Matthew Abate, Corbin Klett, Samuel Coogan, and Eric Feron, Lyapunov Differential Hierarchy and Polynomial Lyapunov Functions for Switched Linear Systems, 2020 American Control Conference artifact, MLF_Case_Study.m.
https://github.com/gtfactslab/Abate_ACC2020/blob/07702a1e3857151b0b916e8a4d8d9340e27b5bfc/MLF_Case_Study.m
unknown (the artifact does not state redistribution terms)
optimal
2.72956
0.000001
0.000001
Mosek 11.2.4
optimal
2.72956
0.000566
2026-09-17
h60-7f/abate_acc2020_mlf_order2.mof.json
h60-7f/abate_acc2020_mlf_order2.yaml
2,289
65ef2b654fe98ffcef3928abddbefbfdf7f8448e985e7f08651d7fd1e7972990
1
sdp/abate_acc2020_mlf_order26
Abate ACC2020 switched-system Meta-Lyapunov SDP (order 26)
sdp
The order-26 homogeneous polynomial Meta-Lyapunov SDP from the Abate et al. ACC 2020 MATLAB artifact. Its lifted vector is [x1^13, x1^12*x2, ..., x2^13] (dimension 14); it imposes P >= I and negative semidefinite Lyapunov inequalities for both published switched-system modes.
[ "continuous", "control", "lyapunov", "polynomial", "semidefinite", "switched-system" ]
imported
abate-acc2020-polynomial-lyapunov
Matthew Abate, Corbin Klett, Samuel Coogan, and Eric Feron, Lyapunov Differential Hierarchy and Polynomial Lyapunov Functions for Switched Linear Systems, 2020 American Control Conference artifact, MLF_Case_Study.m.
https://github.com/gtfactslab/Abate_ACC2020/blob/07702a1e3857151b0b916e8a4d8d9340e27b5bfc/MLF_Case_Study.m
unknown (no license file at the pinned artifact commit)
unknown
null
null
null
null
null
null
null
null
h00-1f/abate_acc2020_mlf_order26.mof.json.zst
h00-1f/abate_acc2020_mlf_order26.yaml
4,062
fe2b46e4f758ce9239e62994cab374950cfa9440e99a34f8adf2d312565a786a
1
sdp/abate_acc2021_fig1a_lyapunov
ACC 2021 LTV Lyapunov performance SDP
sdp
Common-Lyapunov SDP for Figure 1a, with the explicit A, b, and c matrices.
[ "continuous", "imported", "control", "dynamic", "lyapunov", "semidefinite" ]
imported
abate-acc2021-ltv-lyapunov-sdp
abate_acc2021_fig1a_lyapunov representative transcription from the ACC 2021 LTV Lyapunov performance SDP family; source artifact listed in the catalog.
https://github.com/gtfactslab/Abate_ACC2021
unknown
optimal
8
0.000001
0.000001
Mosek 11.2.4
optimal
8
0.000494
2026-09-17
h00-1f/abate_acc2021_fig1a_lyapunov.mof.json
h00-1f/abate_acc2021_fig1a_lyapunov.yaml
1,992
40fc254ae768bd660b6ff41668d5dc1a888cdd436fbc57f780179ba3cf3cd62d
1
sdp/abrazinskas_quad_metric_first20_sdp
Abrazinskas quadratic metric first-20-pair SDP
sdp
Fixed 20-pair SDP reformulation of the source quad_pseud_metric.m example. It uses the first 20 rows of the explicit quad_metric_data_norng.m arrays, a 5-by-5 PSD metric P, affine squared-distance variables, and 2-by-2 PSD square-root epigraphs.
[ "fixed-data", "imported", "metric-learning", "semidefinite", "teaching" ]
imported
abrazinskas-convex-optimization
convex-optimization commit bb69eb740fcbccd7657b2634880270da27d7da79: w8-geometric_problems/quad_pseud_metric.m (SHA-256 e61c05704b2bc10a879ad2432ddc149cb7728144dcb6a62037d5936e51e271b9) and quad_metric_data_norng.m (SHA-256 18d9aa6135d6181db7622cdd22a0996836132dc7625548015faae69779ab6846); repository LICENSE SHA-256 7c...
https://github.com/abrazinskas/convex-optimization
MIT
optimal
0.353652
0.000001
0.000001
Mosek 11.2.4
optimal
0.353652
0.001708
2026-09-20
h60-7f/abrazinskas_quad_metric_first20_sdp.mof.json.zst
h60-7f/abrazinskas_quad_metric_first20_sdp.yaml
3,827
9c21359c4c98414ecc8f1f8a91090352ba9bafdae8b798c80dc609d0da05907e
1
sdp/active_ris_crb_main_m_m8_isac_a8_seed20260923
Active-RIS ISAC beamformer SDP (M=8, source-derived channels)
sdp
First-iteration get_W SDP for the ARIS-ISAC a_max=8 branch with M=8, N=16, and K=4. The model uses the get_W objective, Schur block, BS/RIS power limits, four per-user SINR constraints, and covariance decomposition. Channel geometry and distributions follow the problem's channel model. The random channels and unit-modu...
[ "source-derived-synthetic", "active-ris", "isac", "beamforming", "robust", "semidefinite" ]
source_derived_synthetic
active-ris-isac-crb
Zhu et al., Cramér-Rao Bound Optimization for Active RIS-Empowered ISAC Systems, main_M.m and function/{get_W.m,channel.m,Phi_initial.m}.
https://github.com/RangLiu0706/Active-RIS-ISAC-CRB
CC0-1.0 for independently generated channel coefficients and the MOF transcription; source-material rights are recorded separately in the description and case manifest
optimal
0.000538
0.000001
0.000001
Mosek 11.2.4
optimal
0.000538
0.220261
2026-09-23
ha0-bf/active_ris_crb_main_m_m8_isac_a8_seed20260923.mof.json.zst
ha0-bf/active_ris_crb_main_m_m8_isac_a8_seed20260923.yaml
44,543
2ddb7dd6c1f924422ee7107f463e0ea4e591b81e8145bb03cc1e6451aa08ee95
1
sdp/active_ris_isac_getphi_m2n1k1
Active RIS-ISAC CVX reflection update (M=2, N=1, K=1)
sdp
Complex reflection subproblem get_Phi with amplitude cones, communication QoS cone, RIS power budget, and a concave quadratic objective represented by exact real Schur-complement PSD lifts.
[ "active-ris", "communication", "continuous", "imported", "semidefinite", "soc", "telecommunications" ]
imported
active-ris-isac-detection
Active-RIS-ISAC-detection get_Phi.m and channel.m at commit 258c2f43d4068193ccbced51ab187692457c8aad; repository README cites Zhu, Li, Liu & Liu (2023).
https://github.com/RangLiu0706/Active-RIS-ISAC-detection/blob/258c2f43d4068193ccbced51ab187692457c8aad/get_Phi.m
MIT
optimal
-0.001469
0.000001
0.000001
Mosek 11.2.4
optimal
-0.001469
0.001034
2026-09-17
h00-1f/active_ris_isac_getphi_m2n1k1.mof.json
h00-1f/active_ris_isac_getphi_m2n1k1.yaml
5,613
ae3e16f267f329ce549cb8517f1fcaf0af071fd6014c9102261ad28023f5b2a3
1
sdp/adalineq_theta_bar_plus_dsjc125.1
ADAL-ineq theta-bar+ SDP for DSJC125.1
sdp
The source theta-bar+ SDP for the DIMACS graph-coloring instance DSJC125.1 (125 vertices, 736 edges). It minimizes t subject to X_ii=t-1, X_ij=-1 on nonedges, X_ij>=-1 on edges, t>=0, and X positive semidefinite; this bounds the chromatic number of the complement graph as in the source.
[ "continuous", "combinatorial", "dimacs", "graph", "graph-coloring", "lovasz-theta", "semidefinite", "theta-bar-plus", "n-125" ]
imported
adal-ineq-large-sdp
Federico Battista and Marianna De Santis, Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems (2024), Section 4, formulation (13); graph DSJC125.1.stb from https://github.com/febattista/SDP_lift_and_project revision df703c65b3e765ad3a5ebaf5920b20d01...
https://optimization-online.org/wp-content/uploads/2021/06/R1_4OR_Dealing_with_inequalities_in_large_scale_SDPs-2.pdf
Source repository and DIMACS benchmark redistribution terms are unstated
optimal
38.469338
0.000001
0.000001
Mosek 11.2.4
optimal
38.469338
8.928973
2026-09-20
h40-5f/adalineq_theta_bar_plus_dsjc125.1.mof.json.zst
h40-5f/adalineq_theta_bar_plus_dsjc125.1.yaml
36,786
c91ccd7fe8719c2ec0cf4d70a7080648410dc42c34b999c574557e80198780be
1
sdp/adalineq_theta_bar_plus_dsjc500_5
ADAL-ineq theta-bar+ SDP for DSJC500-5
sdp
The source theta-bar+ SDP for the DIMACS graph-coloring instance DSJC500-5 (500 vertices, 62126 edges). It minimizes t subject to X_ii=t-1, X_ij=-1 on nonedges, X_ij>=-1 on edges, t>=0, and X positive semidefinite; this bounds the chromatic number of the complement graph as in the source.
[ "continuous", "combinatorial", "dimacs", "graph", "graph-coloring", "lovasz-theta", "semidefinite", "theta-bar-plus", "n-500" ]
imported
adal-ineq-large-sdp
Federico Battista and Marianna De Santis, Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems (2024), Section 4, formulation (13); graph DSJC500-5.stb from https://github.com/febattista/SDP_lift_and_project revision df703c65b3e765ad3a5ebaf5920b20d01...
https://optimization-online.org/wp-content/uploads/2021/06/R1_4OR_Dealing_with_inequalities_in_large_scale_SDPs-2.pdf
Source repository and DIMACS benchmark redistribution terms are unstated
feasible
null
null
null
null
null
null
null
null
ha0-bf/adalineq_theta_bar_plus_dsjc500_5.mof.json.zst
ha0-bf/adalineq_theta_bar_plus_dsjc500_5.yaml
626,766
3c55f30724103d7e74dc45a1de354e5805b808f98a19a6bb491da2a0644f89a9
1
sdp/adalineq_theta_plus_brock200_1
ADAL-ineq theta+ SDP for brock200_1
sdp
The source theta+ SDP for the DIMACS stable-set graph brock200_1 (200 vertices, 5066 edges). It minimizes the negative stable-set theta objective in the source's homogenized form, fixes X_00=1 and X_0i=X_ii, sets edge entries to zero, keeps nonedge entries nonnegative, and requires X positive semidefinite.
[ "continuous", "combinatorial", "dimacs", "graph", "lovasz-theta", "semidefinite", "stable-set", "theta-plus", "n-200" ]
imported
adal-ineq-large-sdp
Federico Battista and Marianna De Santis, Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems (2024), Section 4, formulation theta+; graph brock200_1.stb from https://github.com/febattista/SDP_lift_and_project revision df703c65b3e765ad3a5ebaf5920b20...
https://optimization-online.org/wp-content/uploads/2021/06/R1_4OR_Dealing_with_inequalities_in_large_scale_SDPs-2.pdf
Source repository and DIMACS benchmark redistribution terms are unstated
optimal
-27.196716
0.000001
0.000001
Mosek 11.2.4
optimal
-27.196716
142.024118
2026-09-23
h20-3f/adalineq_theta_plus_brock200_1.mof.json.zst
h20-3f/adalineq_theta_plus_brock200_1.yaml
104,272
22d64ad1cb74f76300a04096203d1f093e3ce1e392ca7c0861c52463d85338bd
1
sdp/adalineq_theta_plus_p_hat300_1
ADAL-ineq theta+ SDP for p_hat300-1
sdp
The source theta+ SDP for the DIMACS stable-set graph p_hat300-1 (300 vertices, 33917 edges). It minimizes the negative stable-set theta objective in the source's homogenized form, fixes X_00=1 and X_0i=X_ii, sets edge entries to zero, keeps nonedge entries nonnegative, and requires X positive semidefinite.
[ "continuous", "combinatorial", "dimacs", "graph", "lovasz-theta", "semidefinite", "stable-set", "theta-plus", "n-300" ]
imported
adal-ineq-large-sdp
Federico Battista and Marianna De Santis, Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems (2024), Section 4, formulation theta+; graph p_hat300-1.stb from https://github.com/febattista/SDP_lift_and_project revision df703c65b3e765ad3a5ebaf5920b20...
https://optimization-online.org/wp-content/uploads/2021/06/R1_4OR_Dealing_with_inequalities_in_large_scale_SDPs-2.pdf
Source repository and DIMACS benchmark redistribution terms are unstated
feasible
null
null
null
null
null
null
null
null
h80-9f/adalineq_theta_plus_p_hat300_1.mof.json.zst
h80-9f/adalineq_theta_plus_p_hat300_1.yaml
233,385
744f45c48b0b485721f484e37dc5de3cde4b4de13f2eaffc981bad0394367a1d
1
sdp/adapol_discrete_residue_sdp_norb4_np10
ADAPOL discrete Matsubara PSD residue SDP
sdp
Real symmetric-PSD residue least-squares SDP corresponding to the matrix-valued discrete-pole tutorial. It uses the tutorial's seed-0 Norb=4, Np=10, beta=20 and N=55 construction with fixed pole positions.
[ "continuous", "fixed-data", "matsubara", "pole-fitting", "quantum-many-body", "semidefinite" ]
imported
adapol-sdp
ADAPOL Adaptive Pole Fitting for Quantum Many-Body Physics, example/discrete.ipynb and src/adapol/fit_utils.py, repository revision 65735017225dbf4ad57e563ebd330589c08b89a1. The SDP uses get_weight with solver=sdp and complex=False.
https://github.com/flatironinstitute/adapol/blob/65735017225dbf4ad57e563ebd330589c08b89a1/example/discrete.ipynb
GPL-3.0-only
optimal
2,346.392663
0.000001
0.000001
Mosek 11.2.4
optimal
2,346.392663
0.822201
2026-09-20
he0-ff/adapol_discrete_residue_sdp_norb4_np10.mof.json.zst
he0-ff/adapol_discrete_residue_sdp_norb4_np10.yaml
42,591
e3ca497ca9b5c70dc78e955e2b400ddb25f36034db4b61a52c3f0fa1376f9fb7
1
sdp/admm_cran_toy_sdp
CRAN ADMM documented 3-by-3 SDP toy example
sdp
Standard-form SDP example: minimize tr(CX) subject to tr(A1 X)=11, tr(A2 X)=19, and X positive semidefinite. The six variables are the upper-triangular entries of a symmetric 3-by-3 decision matrix, with off-diagonal trace coefficients doubled.
[ "sdp", "semidefinite", "admm", "toy", "continuous", "imported" ]
imported
admm-cran-sdp
CRAN ADMM 0.3.4, R/admm.sdp.R @examples block; package by Kisung You and Xiaozhi Zhu.
https://rdrr.io/cran/ADMM/src/R/admm.sdp.R
GPL-3.0-or-later
optimal
13.902228
0.000001
0.000001
Mosek 11.2.4
optimal
13.902228
0.000375
2026-09-17
h00-1f/admm_cran_toy_sdp.mof.json
h00-1f/admm_cran_toy_sdp.yaml
1,306
9ea08ae376a2350474e336f5ada574bb53f8cc335d33bae862c77d0516ca69e6
1
sdp/admm_gp_gpkc_p20_n100_capacity1
ADMM-GP graph partition with knapsack constraints SDP (p=20, n=100)
sdp
Representative n=100 weighted graph from ADMM-GP's GPKCrandRound_p20.mat and first Wlist100 capacity. The source make_GPKC model retains unit diagonal, weighted row-capacity inequalities and the graph Laplacian objective.
[ "continuous", "combinatorial", "graph", "graph-partition", "semidefinite", "admm" ]
imported
admm-graph-partition-sdp
Wiegele and Zhao, SDP-based bounds for graph partition via extended ADMM, arXiv:2105.09075; ADMM-GP repository revision 83e5aff6b99d6692082cb66c1064fdb767d9d528, rand_instances/GPKCrandRound_p20.mat, GPKCrandRound_p20_W.mat and form models/make_GPKC.m.
https://github.com/shudianzhao/ADMM-GP/tree/83e5aff6b99d6692082cb66c1064fdb767d9d528/rand_instances/GPKCrandRound_p20.mat
GPL (LICENSE.md; version not stated)
optimal
14,452.888033
0.000001
0.000001
Mosek 11.2.4
optimal
14,452.888033
4.302317
2026-09-20
h40-5f/admm_gp_gpkc_p20_n100_capacity1.mof.json.zst
h40-5f/admm_gp_gpkc_p20_n100_capacity1.yaml
32,634
a0dab42d0b4c6a16a46c8882af651589dd907e74453f1821478ad066ac27a148
1
sdp/admm_gp_kequipartition_p20_n100_k2
ADMM-GP weighted k-equipartition SDP (p=20, n=100, k=2)
sdp
Representative n=100 weighted graph from ADMM-GP's Keq_rand_p0.20.mat. The MATLAB kequi_form model uses k=2 and retains the graph Laplacian objective, unit diagonal and equal block row sums.
[ "continuous", "combinatorial", "graph", "graph-partition", "semidefinite", "admm" ]
imported
admm-graph-partition-sdp
Wiegele and Zhao, SDP-based bounds for graph partition via extended ADMM, arXiv:2105.09075; ADMM-GP repository revision 83e5aff6b99d6692082cb66c1064fdb767d9d528, rand_instances/Keq_rand_p0.20.mat and form models/kequi_form.m.
https://github.com/shudianzhao/ADMM-GP/tree/83e5aff6b99d6692082cb66c1064fdb767d9d528/rand_instances/Keq_rand_p0.20.mat
GPL (LICENSE.md; version not stated)
optimal
14,752.787598
0.000001
0.000001
Mosek 11.2.4
optimal
14,752.787598
3.787526
2026-09-20
h40-5f/admm_gp_kequipartition_p20_n100_k2.mof.json.zst
h40-5f/admm_gp_kequipartition_p20_n100_k2.yaml
28,167
860c012dd3f22f24ec329eaa6b0607ea5a21831ef16b19e012e4763fd14d97f5
1
sdp/admmsdp_limitdyn_toy1
ADMM SDP limit-dynamics toy1 source toy example
sdp
Source-defined finite SDP from the repository's MATLAB toy example.
[ "continuous", "sdp", "semidefinite", "source-alternative", "admm" ]
imported
admmsdp-limitdyn
Source-defined toy example in Local Second-Order Limit Dynamics of the Alternating Direction Method of Multipliers for Semidefinite Programming; data are generated by toy-examples/toy{1,2,3}.m.
https://github.com/ComputationalRobotics/admmsdp-limitdyn
unknown
optimal
0
0
0
Mosek 11.2.4
optimal
0
0.000317
2026-09-23
h60-7f/admmsdp_limitdyn_toy1.mof.json
h60-7f/admmsdp_limitdyn_toy1.yaml
846
a3e45ca9ac0c8a8357aaee62316ea6a4629285d5a2c74332b66107b9f7857eba
1
sdp/admmsdp_limitdyn_toy2
ADMM SDP limit-dynamics toy2 source toy example
sdp
Finite SDP from the repository's MATLAB toy example.
[ "continuous", "sdp", "semidefinite", "source-alternative", "admm" ]
imported
admmsdp-limitdyn
Source-defined toy example in Local Second-Order Limit Dynamics of the Alternating Direction Method of Multipliers for Semidefinite Programming; data are generated by toy-examples/toy{1,2,3}.m.
https://github.com/ComputationalRobotics/admmsdp-limitdyn
unknown
optimal
0
0
0
Mosek 11.2.4
optimal
0
0.000234
2026-09-23
he0-ff/admmsdp_limitdyn_toy2.mof.json
he0-ff/admmsdp_limitdyn_toy2.yaml
1,133
0d21f28b5dcbf06df804447647d8de31e1c491b9d14da7cfd0e86c3f60351982
1
sdp/admmsdp_limitdyn_toy3
ADMM SDP limit-dynamics toy3 source toy example
sdp
Finite SDP for the MATLAB toy example.
[ "continuous", "sdp", "semidefinite", "source-alternative", "admm" ]
imported
admmsdp-limitdyn
Source-defined toy example in Local Second-Order Limit Dynamics of the Alternating Direction Method of Multipliers for Semidefinite Programming; data are generated by toy-examples/toy{1,2,3}.m.
https://github.com/ComputationalRobotics/admmsdp-limitdyn
unknown
optimal
0
0
0
Mosek 11.2.4
optimal
0
0.000462
2026-09-23
ha0-bf/admmsdp_limitdyn_toy3.mof.json
ha0-bf/admmsdp_limitdyn_toy3.yaml
4,642
2390941b83404ce44413ddb82256fafa51a8c84098d8328fa8aa236894b85f76
1
sdp/admmsdp_linearconv_toy
ADMM linear-convergence toy SDP
sdp
Fixed toy standard-form SDP data shipped with the ADMM convergence artifact.
[ "academic", "semidefinite", "source-grounded" ]
imported
admmsdp-linearconv
admmsdp-linearconv admmdyn-data/toy/SDP_data.mat; fixed 3-by-3 SDPT3-svec standard-form toy SDP SHA-256 28d85f64c95540227d843d793bd55058b2540d2dfb575d43413463ec94f9ba13.
https://raw.githubusercontent.com/ComputationalRobotics/admmsdp-linearconv/master/admmdyn-data/toy/SDP_data.mat
unknown (repository does not state a license)
optimal
0
0.000001
0.000001
Mosek 11.2.4
optimal
0
0.000538
2026-09-17
h60-7f/admmsdp_linearconv_toy.mof.json
h60-7f/admmsdp_linearconv_toy.yaml
1,159
b4a282933331ad09bd76bcad871100e41bd140f9110c2ca7812cf40e77b45bae
1
sdp/adrien_optimal_gradient_n3_distance_pep
Optimal Gradient Method N=3 distance performance-estimation SDP
sdp
Source-backed performance-estimation SDP from the Optimal-Gradient-Method repository: L=1, m=0.1, N=3, initial squared distance at most 1, and objective ||z_3-x_*||^2. The Gram constraints are the ordered SmoothStronglyConvex interpolation inequalities implemented in PESTO.
[ "first-order-method", "performance-estimation", "semidefinite", "source-alternative" ]
imported
gh-adrien-optimal-gradient
Optimal Gradient Method source script at revision 9024bc533f1599de1a597a0f5ff38a6189257b42; PESTO SmoothStronglyConvex interpolation at revision b2771c4bfc8b33d1ae69a846d33dafd822c5030e.
https://github.com/AdrienTaylor/Optimal-Gradient-Method/blob/9024bc533f1599de1a597a0f5ff38a6189257b42/02_Numerical%20Verifications/PESTO_InformationTheoreticExactMethod_EvaluateWorstCaseDistance.m
unknown (Optimal-Gradient-Method has no license file; PESTO dependency is MIT)
optimal
0.193219
0.000001
0.000001
Mosek 11.2.4
optimal
0.193219
0.000646
2026-09-23
he0-ff/adrien_optimal_gradient_n3_distance_pep.mof.json
he0-ff/adrien_optimal_gradient_n3_distance_pep.yaml
7,959
1a7aca1407d354a993f389414790ca6a49ff62cb91648aea60aa85f9e91c93f5
1
sdp/adrien_pep_gm_n1_objective
Adrien-Taylor unconstrained PEP gradient-method SDP
sdp
Finite N=1 smooth-convex performance-estimation SDP with L=1, mu=0, R=1, unit initial-distance bound, and GM step h=1.5. It includes the Gram PSD constraint and interpolation/optimality inequalities.
[ "academic", "imported", "semidefinite" ]
imported
gh-adrien-unconstrained-pep
Taylor, Glineur and Hendrickx, pep_yalmip.m and demo.m, documented gradient method (GM), h=1.5, N=1 specialization of the smooth-convex PEP.
https://github.com/AdrienTaylor/Unconstrained-Performance-Estimation-Problems-first-order-methods-/blob/master/pep_yalmip.m
unknown (repository does not state a license)
optimal
0.125
0
0
Mosek 11.2.4
optimal
0.125
0.000807
2026-09-17
h00-1f/adrien_pep_gm_n1_objective.mof.json
h00-1f/adrien_pep_gm_n1_objective.yaml
2,290
7959d0f0d46122529711c44b97dac09dc0ef5609dd13eacc697918047ca2e8ff
1
sdp/adrien_pep_gm_n2_mingrad_unitstep
Adrien-Taylor unconstrained PEP GM N=2 best-gradient SDP
sdp
Finite N=2 smooth-convex gradient-method performance-estimation SDP,.m case (4): L=1, mu=0, R=1, unit step h=1, best gradient norm over g0, g1, and g2. The Gram PSD constraint, all bidirectional interpolation inequalities, optimality inequalities, and source min-gradient epigraph are retained.
[ "academic", "imported", "semidefinite" ]
imported
gh-adrien-unconstrained-pep
Taylor, Glineur and Hendrickx, pep_yalmip.m and demo.m at revision 4d0e09d7774cbf192221aa8d60b0c4ad2f22355f; explicit case (4).
https://github.com/AdrienTaylor/Unconstrained-Performance-Estimation-Problems-first-order-methods-/blob/4d0e09d7774cbf192221aa8d60b0c4ad2f22355f/demo.m
unknown (repository does not state a license)
optimal
0.111111
0.000001
0.000001
Mosek 11.2.4
optimal
0.111111
0.000645
2026-09-23
ha0-bf/adrien_pep_gm_n2_mingrad_unitstep.mof.json
ha0-bf/adrien_pep_gm_n2_mingrad_unitstep.yaml
5,029
b3279ce72541d0ffa1be8d4dd9e5b62d3f4f48ea3c92fc629d0f4a4ad500b28f
1
sdp/adrien_proximal_gradient_distance_n1
Adrien Taylor proximal-gradient distance PEP (N=1)
sdp
Exact one-step Gram SDP expansion of PESTO_FunctionValuesToDistance.m with smooth-strongly-convex f1 (mu=0.1, L=1), convex f2, gamma=2/11, and initial composite gap at most one.
[ "continuous", "convex", "first-order-method", "performance-estimation", "proximal-gradient", "semidefinite" ]
imported
gh-adrien-proximal-gradient
Adrien Taylor, Julien Hendrickx, and François Glineur, ProximalGradientMethod repository, PESTO_FunctionValuesToDistance.m at revision 5425c978c4900f37c0edc7de986c84d7edcff956.
https://github.com/AdrienTaylor/ProximalGradientMethod/blob/5425c978c4900f37c0edc7de986c84d7edcff956/PESTO_FunctionValuesToDistance.m
unknown (repository does not state a license)
optimal
19.279339
0.000001
0.000001
Mosek 11.2.4
optimal
19.279339
0.001138
2026-09-17
h40-5f/adrien_proximal_gradient_distance_n1.mof.json
h40-5f/adrien_proximal_gradient_distance_n1.yaml
9,860
044c7527bbf018b5d619d02f4a35a566d965bb8a66a6843483815a7daa4fc536
1
sdp/ai_hilbert_bell_triple_sos_bound
AI-Hilbert Bell triple Putinar SOS bound
sdp
Exact MOF 1.9 formulation of the degree-zero Putinar certificate in the AI-Hilbert Bell notebook: maximize gamma subject to p_AB+p_AC+p_BC >= gamma on the simplex of eight nonnegative deterministic assignments. The eight nonnegative lambda variables are the 1-by-1 SOS multipliers for the domain inequalities, and lambda...
[ "sdp", "sos", "semidefinite", "sum-of-squares", "bell", "polynomial", "imported" ]
imported
ibm-ai-hilbert
IBM AI-Hilbert, main_problems/bell_inequalities[3.8].ipynb, Bell's inequality section (commit 621b08ba666d30b374ca70f2c12752e6b59c995f).
https://github.com/IBM/AI-Hilbert/blob/621b08ba666d30b374ca70f2c12752e6b59c995f/main_problems/bell_inequalities%5B3.8%5D.ipynb
MIT
optimal
1
0.000001
0.000001
Mosek 11.2.4
optimal
1
0.000348
2026-09-17
h20-3f/ai_hilbert_bell_triple_sos_bound.mof.json
h20-3f/ai_hilbert_bell_triple_sos_bound.yaml
3,635
b4d259e36e274476b54e1b413c8439ca207c5be10ed9b2cef546d537a4d59a89
1
sdp/ai_hilbert_i3322_sos_bound
AI-Hilbert I3322 Putinar SOS bound
sdp
Degree-zero Putinar certificate SDP for the I3322 inequality: minimize gamma subject to gamma >= E_overall on the simplex of 64 nonnegative deterministic assignments. The 64 nonnegative lambda variables are the 1-by-1 SOS multipliers for the domain inequalities, and lambda_normalization is the unrestricted multiplier f...
[ "sdp", "sos", "semidefinite", "sum-of-squares", "bell", "polynomial", "imported" ]
imported
ibm-ai-hilbert
IBM AI-Hilbert, main_problems/bell_inequalities[3.8].ipynb, I3322 section (commit 621b08ba666d30b374ca70f2c12752e6b59c995f).
https://github.com/IBM/AI-Hilbert/blob/621b08ba666d30b374ca70f2c12752e6b59c995f/main_problems/bell_inequalities%5B3.8%5D.ipynb
MIT
optimal
4
0.000001
0.000001
Mosek 11.2.4
optimal
4
0.000226
2026-09-20
hc0-df/ai_hilbert_i3322_sos_bound.mof.json.zst
hc0-df/ai_hilbert_i3322_sos_bound.yaml
1,047
4e1e8bcc732104a3432a83afa4cc5133ce3ceac2fb478ff4e0fecd210fae5d20
1
sdp/aimir_erdos128_s0_flag_gram_certificate
Erdos sparse-halves flag-algebra Gram SDP certificate
sdp
Three-by-three rootless flag Gram block from the exact rational certificate for t(C4) - rho^3 + (3/64 + 1/50000000000)rho >= 0. The six entries are fixed to the sum of the 31 source weighted-square terms in block s0_root0 and constrained to the positive-semidefinite cone.
[ "certificate", "combinatorial", "continuous", "flag-algebra", "graph", "semidefinite", "sos" ]
imported
aimir-erdos128-sparse-halves
aimir/erdos-128-sparse-halves, clebsch_tangent_certificate.json (commit ba85f319ebb33ec2194ef4c2929a12916329e1e7), s0_root0 block.
https://github.com/aimir/erdos-128-sparse-halves/blob/ba85f319ebb33ec2194ef4c2929a12916329e1e7/clebsch_tangent_certificate.json
unknown
optimal
0
0.000001
0.000001
Mosek 11.2.4
optimal
0
0.000177
2026-09-18
h80-9f/aimir_erdos128_s0_flag_gram_certificate.mof.json
h80-9f/aimir_erdos128_s0_flag_gram_certificate.yaml
1,641
58cacb6417a666eae4d4e90786ad656c5b69f7d6a00bfa98dfd097ebccdff9b8
1
sdp/ajpgarner_heisenberg_two_qubit_sdp
Heisenberg two-qubit ground-state SDP
sdp
Finite density-matrix SDP companion for the default two-qubit Heisenberg Hamiltonian in ajpgarner/heisenberg_energy: 1/4 times XX+YY+ZZ, with trace-one real density matrix.
[ "academic", "continuous", "fixed-data", "semidefinite" ]
imported
ajpgarner-heisenberg-energy
A. J. P. Garner, Heisenberg ground state energy bounds, source heisenberg_chain_limit.m and heisenberg_chain_symmetrized.m.
https://github.com/ajpgarner/heisenberg_energy
unknown
optimal
-0.75
0
0
Mosek 11.2.4
optimal
-0.75
0.000335
2026-09-17
ha0-bf/ajpgarner_heisenberg_two_qubit_sdp.mof.json
ha0-bf/ajpgarner_heisenberg_two_qubit_sdp.yaml
1,241
0a69c5dd7c8ad1d4b5d39913efeb981808347c6dfeb98ba66f253fb3c626b42a
1
sdp/alfonso_robinson_wsos_order3
Alfonso Robinson weighted SOS Gram SDP
sdp
Exact polynomial-side Gram SDP for the Robinson degree-six example in Alfonso's polyOpt.m on [-1,1]^2 with d=3. It retains the source weighted SOS structure: one degree-six SOS block and one degree-four SOS block for each of the two box weights 1-x1^2 and 1-x2^2, plus every coefficient equality.
[ "academic", "continuous", "global-optimization", "imported", "polynomial", "semidefinite", "sos" ]
imported
alfonso-sos-examples
Alfonso examples/poly_opt/polyOpt.m, Robinson polynomial branch (pinned revision 86d5a91dc4de87bb2b7c5bd066d912f16cca6cc8); exact WSOS order d=3 formulation.
https://github.com/dpapp-github/alfonso/blob/86d5a91dc4de87bb2b7c5bd066d912f16cca6cc8/examples/poly_opt/polyOpt.m
BSD-2-Clause
optimal
6
0.000001
0.000001
Mosek 11.2.4
optimal
6
0.001127
2026-09-20
h60-7f/alfonso_robinson_wsos_order3.mof.json.zst
h60-7f/alfonso_robinson_wsos_order3.yaml
1,111
31e4706f31a0d8f2c2eb80ad0465282b1432f03554e67dfaac850890f39dc2c2
1
sdp/algebraic_stability_sdirk54_cstw_sdp
SDIRK(5,4) algebraic-stability CSTW feasibility SDP
sdp
Exact three-variable CSTW semidefinite feasibility formulation from the Juhl-Shirokoff SDIRK(5,4) MATLAB supplement. The rational five-stage Butcher matrix, b vector, symmetric N*e=0 correction, two prescribed X null vectors, and simultaneous R/X stability LMIs are retained symbolically.
[ "continuous", "dynamic", "fixed-data", "lmi", "runge-kutta", "semidefinite", "stability" ]
imported
algebraic-stability-sdp
Austin Juhl and David Shirokoff, Algebraic Conditions for Stability in Runge-Kutta Methods and Their Certification via Semidefinite Programming; supplement revision 1648b9b974be57441ab76d48795832592196d74e, MIT license.
https://github.com/ajuhl/algebraic-conditions-for-stability-certified-via-sdp/blob/1648b9b974be57441ab76d48795832592196d74e/Examples/SDIRK(5,4)/sdirk54.m
MIT
feasible
null
null
null
Mosek 11.2.4
feasible
null
0.001945
2026-09-17
h60-7f/algebraic_stability_sdirk54_cstw_sdp.mof.json
h60-7f/algebraic_stability_sdirk54_cstw_sdp.yaml
7,148
b8a43dcde5ebc0668d8ef2362c3e1436112d1600428ab41e3c82f248fb9c5770
1
sdp/alibaba_admm_semidefinite_program_seed1
Alibaba ADMM fixed-seed 4x4 semidefinite program
sdp
Fixed numeric MOF formulation of Alibaba ADMM's examples/semidefinite_program.py. With np.random.seed(1), the example minimizes tr(CX) for C=R.T@R over a 4x4 PSD matrix and imposes three symmetric trace equalities.
[ "continuous", "semidefinite", "trace-constraints", "benchmark", "fixed-data" ]
imported
alibaba-admm-finance
Alibaba DAMO Academy ADMM, examples/semidefinite_program.py, commit 63d85be14e37e403ecf8dd7ed86f1268772925f2.
https://github.com/alibaba-damo-academy/admm/blob/63d85be14e37e403ecf8dd7ed86f1268772925f2/examples/semidefinite_program.py
MIT
optimal
0.429535
0.0001
0.0001
Mosek 11.2.4
optimal
0.429567
0.000421
2026-09-18
h20-3f/alibaba_admm_semidefinite_program_seed1.mof.json
h20-3f/alibaba_admm_semidefinite_program_seed1.yaml
3,248
a4c22cc837726a5048ecd469397ba0d91e4f99bf70ae3b7e5b2c4b2b27ac5453
1
sdp/almost_idempotent_complex_qubit_watrous_primal
Almost-idempotent channel Watrous primal SDP (complex_qubit)
sdp
Exact complex Watrous maximum-primal diamond-norm SDP from AICMosekExt, using the fixed J=Choi(Phi^2-Phi) generated by complex_qubit_kraus(). Hermitian PSD P and Q satisfy P+Q=I and the 8-by-8 block [[P,X],[X',Q]] is Hermitian PSD.
[ "complex", "continuous", "diamond-norm", "hermitian", "quantum", "semidefinite" ]
imported
almost-idempotent-channels-sdp
Tobias Osborne, AlmostIdempotentChannels.jl, test/fixtures.jl (complex_qubit_kraus()) and ext/AICMosekExt.jl Watrous primal; commit ceeeee029054 (retrieved 2026-09-04).
https://github.com/tobiasosborne/almost-idempotent-channels/blob/ceeeee0290545b1e00369cd547c5da8949053ccc/julia/AlmostIdempotentChannels.jl/test/fixtures.jl
AGPL-3.0
optimal
1.28
0.000001
0.000001
Mosek 11.2.4
optimal
1.28
0.002326
2026-09-17
h40-5f/almost_idempotent_complex_qubit_watrous_primal.mof.json
h40-5f/almost_idempotent_complex_qubit_watrous_primal.yaml
9,611
db4a89d0bb909155793384235e411b38d426f405be0f4abee4565e363da1cdbe
1
sdp/almost_idempotent_phi_t_2_0p3_watrous_primal
Almost-idempotent channel Watrous primal SDP (phi_t_2_0p3)
sdp
Exact complex Watrous maximum-primal diamond-norm SDP from AICMosekExt, using the fixed J=Choi(Phi^2-Phi) generated by phit_kraus(2, 0.3). Hermitian PSD P and Q satisfy P+Q=I and the 8-by-8 block [[P,X],[X',Q]] is Hermitian PSD.
[ "complex", "continuous", "diamond-norm", "hermitian", "quantum", "semidefinite" ]
imported
almost-idempotent-channels-sdp
Tobias Osborne, AlmostIdempotentChannels.jl, test/fixtures.jl (phit_kraus(2, 0.3)) and ext/AICMosekExt.jl Watrous primal; commit ceeeee029054 (retrieved 2026-09-04).
https://github.com/tobiasosborne/almost-idempotent-channels/blob/ceeeee0290545b1e00369cd547c5da8949053ccc/julia/AlmostIdempotentChannels.jl/test/fixtures.jl
AGPL-3.0
optimal
0.315
0.000001
0.000001
Mosek 11.2.4
optimal
0.315
0.00232
2026-09-17
h80-9f/almost_idempotent_phi_t_2_0p3_watrous_primal.mof.json
h80-9f/almost_idempotent_phi_t_2_0p3_watrous_primal.yaml
9,519
bad4e4576dee5394fb560d766e0eff816992723e0b8ebb42e434acd3ad26e6e0
1
sdp/alpha2_rank7
Quad-C5 contextuality Lovasz-theta SDP (alpha2_rank7)
sdp
Finite 8-by-8 Lovasz-theta SDP from the Quad-C5 exhaustive connected 8-vertex graph search, source rank 7 (graph6 GQyurg). It maximizes <J,X> with trace(X)=1, zero entries on graph edges, and X positive semidefinite.
[ "academic", "contextuality", "continuous", "graph", "lovasz-theta", "semidefinite" ]
imported
quad-c5-contextuality
U. Tamer, O. E. Mustecaplioglu, A. Dizdar and Z. Gedik, The Quad-C5 Graph: Maximum Contextuality Gap on Eight Vertices, repository commit bfacfd098be18f84bf332547be634db059978dcb; certification.py and all_n8_results.csv rank 7 (graph6 GQyurg).
https://github.com/ugurtamerphys/quad-c5-contextuality/tree/bfacfd098be18f84bf332547be634db059978dcb
unknown
optimal
2.343146
0.000001
0.000001
Mosek 11.2.4
optimal
2.343146
0.000507
2026-09-17
h80-9f/alpha2_rank7.mof.json
h80-9f/alpha2_rank7.yaml
4,998
28c5c4a591de110b275be8d96d179ecd1c1d0acd93d7d86ccb54a2b0a28e38aa
1
sdp/alpha4_rank28
Quad-C5 contextuality Lovasz-theta SDP (alpha4_rank28)
sdp
Finite 8-by-8 Lovasz-theta SDP from the Quad-C5 exhaustive connected 8-vertex graph search, source rank 28 (graph6 G?b@aS). It maximizes <J,X> with trace(X)=1, zero entries on graph edges, and X positive semidefinite.
[ "academic", "contextuality", "continuous", "graph", "lovasz-theta", "semidefinite" ]
imported
quad-c5-contextuality
U. Tamer, O. E. Mustecaplioglu, A. Dizdar and Z. Gedik, The Quad-C5 Graph: Maximum Contextuality Gap on Eight Vertices, repository commit bfacfd098be18f84bf332547be634db059978dcb; certification.py and all_n8_results.csv rank 28 (graph6 G?b@aS).
https://github.com/ugurtamerphys/quad-c5-contextuality/tree/bfacfd098be18f84bf332547be634db059978dcb
unknown
optimal
4.236068
0.000001
0.000001
Mosek 11.2.4
optimal
4.236068
0.000624
2026-09-17
ha0-bf/alpha4_rank28.mof.json
ha0-bf/alpha4_rank28.yaml
4,135
7aa69d5e5d323015163e825eed695421396e2fca26476d53b6fd31bce7de0c89
1
sdp/alpha5_rank508
Quad-C5 contextuality Lovasz-theta SDP (alpha5_rank508)
sdp
Finite 8-by-8 Lovasz-theta SDP from the Quad-C5 exhaustive connected 8-vertex graph search, source rank 508 (graph6 G?AEBw). It maximizes <J,X> with trace(X)=1, zero entries on graph edges, and X positive semidefinite.
[ "academic", "contextuality", "continuous", "graph", "lovasz-theta", "semidefinite" ]
imported
quad-c5-contextuality
U. Tamer, O. E. Mustecaplioglu, A. Dizdar and Z. Gedik, The Quad-C5 Graph: Maximum Contextuality Gap on Eight Vertices, repository commit bfacfd098be18f84bf332547be634db059978dcb; certification.py and all_n8_results.csv rank 508 (graph6 G?AEBw).
https://github.com/ugurtamerphys/quad-c5-contextuality/tree/bfacfd098be18f84bf332547be634db059978dcb
unknown
optimal
5
0.000001
0.000001
Mosek 11.2.4
optimal
5
0.000596
2026-09-17
h20-3f/alpha5_rank508.mof.json
h20-3f/alpha5_rank508.yaml
4,136
28a0efdcfd3d93fc13e26712783758e98d3122a6fc748bd97ea695653aff2574
1
sdp/alpha6_rank502
Quad-C5 contextuality Lovasz-theta SDP (alpha6_rank502)
sdp
Finite 8-by-8 Lovasz-theta SDP from the Quad-C5 exhaustive connected 8-vertex graph search, source rank 502 (graph6 G??FeW). It maximizes <J,X> with trace(X)=1, zero entries on graph edges, and X positive semidefinite.
[ "academic", "contextuality", "continuous", "graph", "lovasz-theta", "semidefinite" ]
imported
quad-c5-contextuality
U. Tamer, O. E. Mustecaplioglu, A. Dizdar and Z. Gedik, The Quad-C5 Graph: Maximum Contextuality Gap on Eight Vertices, repository commit bfacfd098be18f84bf332547be634db059978dcb; certification.py and all_n8_results.csv rank 502 (graph6 G??FeW).
https://github.com/ugurtamerphys/quad-c5-contextuality/tree/bfacfd098be18f84bf332547be634db059978dcb
unknown
optimal
6
0.000001
0.000001
Mosek 11.2.4
optimal
6
0.000595
2026-09-17
h20-3f/alpha6_rank502.mof.json
h20-3f/alpha6_rank502.yaml
4,136
649a4309267de264be91711879e386b418c819d52438f913cd9c3447ad3ff7d9
1
sdp/alpha7_rank501
Quad-C5 contextuality Lovasz-theta SDP (alpha7_rank501)
sdp
Finite 8-by-8 Lovasz-theta SDP from the Quad-C5 exhaustive connected 8-vertex graph search, source rank 501 (graph6 G???F{). It maximizes <J,X> with trace(X)=1, zero entries on graph edges, and X positive semidefinite.
[ "academic", "contextuality", "continuous", "graph", "lovasz-theta", "semidefinite" ]
imported
quad-c5-contextuality
U. Tamer, O. E. Mustecaplioglu, A. Dizdar and Z. Gedik, The Quad-C5 Graph: Maximum Contextuality Gap on Eight Vertices, repository commit bfacfd098be18f84bf332547be634db059978dcb; certification.py and all_n8_results.csv rank 501 (graph6 G???F{).
https://github.com/ugurtamerphys/quad-c5-contextuality/tree/bfacfd098be18f84bf332547be634db059978dcb
unknown
optimal
7
0.000001
0.000001
Mosek 11.2.4
optimal
7
0.00041
2026-09-17
ha0-bf/alpha7_rank501.mof.json
ha0-bf/alpha7_rank501.yaml
4,028
8d51c02c0a8639f4c24be72da3beb60644e3d4ea1718c6056664633f98c6ca47
1
sdp/anisotropic_ra_lu_sphinx
Anisotropic-RA LU Sphinx rotation-averaging SDP
sdp
Real-data LU Sphinx rotation-averaging instance from anisotropic-ra, with 70 camera poses and 1207 observed relative rotations. This is the source's isotropic O(3) Gram-matrix relaxation: each 3-by-3 diagonal block is fixed to identity and the relative-rotation score is maximized.
[ "continuous", "geometry", "graph", "rotation-averaging", "semidefinite" ]
imported
anisotropic-rotation-averaging-sdp
Olsson, Lochman, Malmport, and Zach, Certifiably Optimal Anisotropic Rotation Averaging (2025), anisotropic-ra data/lu_sphinx.mat, pinned to commit f0ede76128edd893e2fa5a5727b6b94de44bc1be.
https://raw.githubusercontent.com/ylochman/anisotropic-ra/f0ede76128edd893e2fa5a5727b6b94de44bc1be/data/lu_sphinx.mat
MIT
optimal
7,241.194123
0.000001
0.000001
Mosek 11.2.4
optimal
7,241.194123
0.081716
2026-09-20
h60-7f/anisotropic_ra_lu_sphinx.mof.json.zst
h60-7f/anisotropic_ra_lu_sphinx.yaml
150,598
4c2b5219e75de315d4108466788aba81449d144c1d8c91a4fd331513224059a6
1
sdp/annualresearcher_scp_opf_ieee118_bim_sdp
AnnualResearcher IEEE-118 BIM SDP-OPF
sdp
IEEE-118 BIM SDP-OPF benchmark. The real 236-by-236 voltage Gram matrix is PSD, with active/reactive injection equations, generator bounds, voltage limits, fixed slack voltage, and total-injection loss objective.
[ "continuous", "fixed-data", "lmi", "network", "optimal-power-flow", "power-flow", "sdp", "semidefinite" ]
imported
annualresearcher-scp-opf
AnnualResearcher successive-convex-programming-opf, revision 397ae4b0e9880ebc15e5f7470fc1bb83c2aee2d0; pinned IEEE network builder and _legacy/sdp.py BIM relaxation. Network counts: 118 buses, 179 branches, 99 loads, 53 sgens. Network data: pandapower 3.0.0 network fixture, checked against fixture data at revision 2828...
https://github.com/AnnualResearcher/successive-convex-programming-opf/blob/397ae4b0e9880ebc15e5f7470fc1bb83c2aee2d0/src/scp_opf_bench/_legacy/sdp.py
unknown (AnnualResearcher code is MIT; pandapower fixture license is BSD-3-Clause, but cataloged network provenance is mixed)
feasible
null
null
null
Mosek 11.2.4
feasible
null
0.51167
2026-09-23
hc0-df/annualresearcher_scp_opf_ieee118_bim_sdp.mof.json.zst
hc0-df/annualresearcher_scp_opf_ieee118_bim_sdp.yaml
69,465
99af3264cbd0248e9c7be78a521a6739189ceb6fe4dd191c4d6af6d9af8d1b9c
1
sdp/annualresearcher_scp_opf_ieee123_bim_sdp
AnnualResearcher IEEE-123 BIM SDP-OPF
sdp
IEEE-123 BIM SDP-OPF benchmark. The real 252-by-252 voltage Gram matrix is PSD; source Y-bus construction includes 120 line branches and five closed bus-switch links, giving one connected radial network with 126 buses.
[ "continuous", "fixed-data", "lmi", "network", "optimal-power-flow", "power-flow", "sdp", "semidefinite" ]
imported
annualresearcher-scp-opf
AnnualResearcher successive-convex-programming-opf, revision 397ae4b0e9880ebc15e5f7470fc1bb83c2aee2d0; pinned IEEE network builder and _legacy/sdp.py BIM relaxation. Network counts: 126 buses, 120 branches, 85 loads, 16 sgens. Network data: pinned _legacy/IEEE123Node Excel sheets, reconstructed from IEEE PES Test Feede...
https://github.com/AnnualResearcher/successive-convex-programming-opf/blob/397ae4b0e9880ebc15e5f7470fc1bb83c2aee2d0/src/scp_opf_bench/_legacy/sdp.py
unknown (IEEE PES feeder data is embedded for IEEE-123; redistribution terms were not found; AnnualResearcher repository code is MIT)
feasible
null
null
null
Mosek 11.2.4
feasible
null
0.602001
2026-09-23
h60-7f/annualresearcher_scp_opf_ieee123_bim_sdp.mof.json.zst
h60-7f/annualresearcher_scp_opf_ieee123_bim_sdp.yaml
68,561
741260b35bf973e5290653f16091040a8af0ea158a7db50337240d8fa6a31236
1
sdp/annualresearcher_scp_opf_ieee14_bim_sdp
AnnualResearcher IEEE-14 BIM SDP-OPF
sdp
Faithful fixed-data reproduction of the AnnualResearcher benchmark's IEEE-14 SDP method. The real 28-by-28 voltage Gram matrix W is PSD and retains the source Y-bus active/reactive injection equations, generator dispatch bounds, 0.9--1.1 voltage limits, fixed 1.06 slack voltage, and source total-injection loss objectiv...
[ "continuous", "fixed-data", "lmi", "network", "optimal-power-flow", "power-flow", "sdp", "semidefinite" ]
imported
annualresearcher-scp-opf
AnnualResearcher successive-convex-programming-opf, revision 397ae4b0e9880ebc15e5f7470fc1bb83c2aee2d0; IEEE-14 builder and _legacy/sdp.py BIM relaxation. The fixed pandapower case14 fixture is revision 28286042ec1174a8427aebe9ccfe32aa27253bff (https://github.com/e2nIEE/pandapower/blob/28286042ec1174a8427aebe9ccfe32aa27...
https://github.com/AnnualResearcher/successive-convex-programming-opf/blob/397ae4b0e9880ebc15e5f7470fc1bb83c2aee2d0/src/scp_opf_bench/_legacy/sdp.py
MIT
feasible
null
null
null
null
null
null
null
null
h20-3f/annualresearcher_scp_opf_ieee14_bim_sdp.mof.json.zst
h20-3f/annualresearcher_scp_opf_ieee14_bim_sdp.yaml
3,992
27b28fe99ce8cd48849f6b4409aa6a73ba276fed35e441b80382d39034e45257
1
sdp/annualresearcher_scp_opf_ieee33_bim_sdp
AnnualResearcher IEEE-33 BIM SDP-OPF
sdp
IEEE-33 BIM SDP-OPF benchmark. The real 66-by-66 voltage Gram matrix is PSD; active/reactive injection equations, generator bounds, voltage limits, fixed slack voltage, and total-injection loss objective define the model.
[ "continuous", "fixed-data", "lmi", "network", "optimal-power-flow", "power-flow", "sdp", "semidefinite" ]
imported
annualresearcher-scp-opf
AnnualResearcher successive-convex-programming-opf, revision 397ae4b0e9880ebc15e5f7470fc1bb83c2aee2d0; pinned IEEE network builder and _legacy/sdp.py BIM relaxation. Network counts: 33 buses, 32 branches, 32 loads, 4 sgens. Network data: pandapower 3.0.0 network fixture, checked against fixture data at revision 2828604...
https://github.com/AnnualResearcher/successive-convex-programming-opf/blob/397ae4b0e9880ebc15e5f7470fc1bb83c2aee2d0/src/scp_opf_bench/_legacy/sdp.py
unknown (AnnualResearcher code is MIT; pandapower fixture license is BSD-3-Clause, but cataloged network provenance is mixed)
optimal
0.085443
0.000001
0.000001
Mosek 11.2.4
optimal
0.085443
0.022864
2026-09-23
he0-ff/annualresearcher_scp_opf_ieee33_bim_sdp.mof.json.zst
he0-ff/annualresearcher_scp_opf_ieee33_bim_sdp.yaml
9,014
ec29e3749c004fca05f5c901611e369b16647dbe4ca44e2eb3c4bc0179e3793b
1
sdp/apgl_psd_completion_n1000_r10_p60497_seed20260923
APGL positive-semidefinite matrix completion (source-derived synthetic, n=1000)
sdp
Synthetic PSD-completion instance for Toh and Yun (2009), problem (10), using n=1000, rank r=10, p=60,497 upper-triangle observations, noise factor 0.1, and mean regularization parameter mu=0.0159. Numerical factors, observation set, and noise use SplitMix64/Box-Muller seed 20260923. Each squared residual has an exact ...
[ "sdp", "semidefinite", "matrix-completion", "least-squares", "source-derived-synthetic" ]
source_derived_synthetic
apgl-psd-completion
Toh and Yun, An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems (2009), problem (10), Section 4.3, Table 6.
https://optimization-online.org/wp-content/uploads/2009/03/2268.pdf
CC0-1.0 (independently generated coefficients and MOF model)
unknown
null
null
null
null
null
null
null
null
h40-5f/apgl_psd_completion_n1000_r10_p60497_seed20260923.mof.json.zst
h40-5f/apgl_psd_completion_n1000_r10_p60497_seed20260923.yaml
1,824,118
13033f47b9133d646a1e83c339cd551ea349b483428d2e5cebfaecc414090a58
1
sdp/aramani_mae598_controller_d_stability_5d
MAE 598 controller D-stability LMI, 5-state source case
sdp
ControllerDStability.m LMI model with fixed A, B, tr=1, ts=6, p_os=0.1, and four controller/damping LMIs.
[ "continuous", "sdp", "semidefinite", "control", "source-exact", "source-alternative" ]
imported
aramani-mae-598-lmi-codes
MAE-598-LMI-Codes, ControllerDStability.m, commit 55ae1213989e4a58f9c94f417e518de3b4ee697b.
https://github.com/aramani3/MAE-598-LMI-Codes/blob/55ae1213989e4a58f9c94f417e518de3b4ee697b/ControllerDStability.m
unknown
optimal
null
null
null
Mosek 11.2.4
optimal
null
0.002297
2026-09-23
he0-ff/aramani_mae598_controller_d_stability_5d.mof.json.zst
he0-ff/aramani_mae598_controller_d_stability_5d.yaml
2,171
51b35fafab7c5d575dcfde38244af441f8ffcde26fad27e367b9da0693caf5ec
1
sdp/aramani_mae598_d_stability_3d
MAE 598 D-stability LMI, 3-state source case
sdp
D-stability SDP with the source matrices A and B, q=2, r=1, positive-definite P, and a 6-by-6 block D-stability LMI.
[ "continuous", "sdp", "semidefinite", "control", "source-exact", "source-alternative" ]
imported
aramani-mae-598-lmi-codes
MAE-598-LMI-Codes, DStability.m, commit 55ae1213989e4a58f9c94f417e518de3b4ee697b.
https://github.com/aramani3/MAE-598-LMI-Codes/blob/55ae1213989e4a58f9c94f417e518de3b4ee697b/DStability.m
unknown
optimal
null
null
null
Mosek 11.2.4
optimal
null
0.000726
2026-09-23
h20-3f/aramani_mae598_d_stability_3d.mof.json
h20-3f/aramani_mae598_d_stability_3d.yaml
4,095
d2cae0d6b2ea2d6d65f9bdacebe8a9605d269891336e87a3e7fd87a50ba797dd
1
sdp/aramani_mae598_delay_dependent_dbar01_3d
MAE 598 delay-dependent time-delay LMI, dbar=0.1
sdp
DelayDependentTimeDelay.m LMI model with fixed A, Ad, B, dbar=0.1, beta in [0,1], and a 9-by-9 delay-dependent LMI.
[ "continuous", "sdp", "semidefinite", "control", "source-exact", "source-alternative" ]
imported
aramani-mae-598-lmi-codes
MAE-598-LMI-Codes, DelayDependentTimeDelay.m, commit 55ae1213989e4a58f9c94f417e518de3b4ee697b.
https://github.com/aramani3/MAE-598-LMI-Codes/blob/55ae1213989e4a58f9c94f417e518de3b4ee697b/DelayDependentTimeDelay.m
unknown
optimal
null
null
null
Mosek 11.2.4
optimal
null
0.000759
2026-09-23
he0-ff/aramani_mae598_delay_dependent_dbar01_3d.mof.json
he0-ff/aramani_mae598_delay_dependent_dbar01_3d.yaml
8,115
655aeb5df7223363ac6f6de343d64c907f3cfa0d00015abd6007761d8f62b3e2
1
sdp/aramani_mae598_delay_independent_3d
MAE 598 delay-independent time-delay LMI, 3-state source case
sdp
Delay-independent time-delay LMI with fixed matrices A, Ad, and B, positive-cone variables X and Y, and a 6-by-6 LMI.
[ "continuous", "sdp", "semidefinite", "control", "source-exact", "source-alternative" ]
imported
aramani-mae-598-lmi-codes
MAE-598-LMI-Codes, DelayIndependentTimeDelay.m, commit 55ae1213989e4a58f9c94f417e518de3b4ee697b.
https://github.com/aramani3/MAE-598-LMI-Codes/blob/55ae1213989e4a58f9c94f417e518de3b4ee697b/DelayIndependentTimeDelay.m
unknown
optimal
null
null
null
Mosek 11.2.4
optimal
null
0.00127
2026-09-23
hc0-df/aramani_mae598_delay_independent_3d.mof.json
hc0-df/aramani_mae598_delay_independent_3d.yaml
6,368
1222c8bfc63dfec1f6fdb17a5e3731e20d8c1b1fa78c076df2eb93eb4116d5c3
1
sdp/aramani_mae598_h2_norm
MAE 598 fixed H2-norm SDP example
sdp
H2-norm SDP minimizing gamma over the 4-by-4 Lyapunov and output-trace LMIs.
[ "continuous", "sdp", "semidefinite", "control", "h2-norm", "source-alternative" ]
imported
aramani-mae-598-lmi-codes
MAE-598-LMI-Codes, H2Norm.m, commit 55ae1213989e4a58f9c94f417e518de3b4ee697b.
https://github.com/aramani3/MAE-598-LMI-Codes/blob/55ae1213989e4a58f9c94f417e518de3b4ee697b/H2Norm.m
unknown
optimal
12.672304
0.000001
0.000001
Mosek 11.2.4
optimal
12.672304
0.000648
2026-09-23
h20-3f/aramani_mae598_h2_norm.mof.json
h20-3f/aramani_mae598_h2_norm.yaml
5,009
ee80563e3ea4b28df7c2670faf8b2b3fadc72760647d2ee79a03b553e78cf975
1
sdp/aramani_mae598_h_stability_20d
MAE 598 H-stability LMI, 20-state source case
sdp
H-stability LMI for a 20-state system with lower-bidiagonal A, B=e1, alpha=1, beta=3, and two 20-by-20 LMIs.
[ "continuous", "sdp", "semidefinite", "control", "source-exact", "source-alternative" ]
imported
aramani-mae-598-lmi-codes
MAE-598-LMI-Codes, HStability.m, commit 55ae1213989e4a58f9c94f417e518de3b4ee697b.
https://github.com/aramani3/MAE-598-LMI-Codes/blob/55ae1213989e4a58f9c94f417e518de3b4ee697b/HStability.m
unknown
unknown
null
null
null
null
null
null
null
null
hc0-df/aramani_mae598_h_stability_20d.mof.json.zst
hc0-df/aramani_mae598_h_stability_20d.yaml
4,871
2ca4427ed261515c610763935a01788fe8bbd84a3f7f3d612f2bfbf6cb432e84
1
sdp/aramani_mae598_insensitive_disk_region_3d
MAE 598 insensitive disk-region LMI, 3-state source case
sdp
InsensitiveDiskRegion model with fixed A, B, C, q=4, and controller K. It minimizes gamma subject to the 6-by-6 disk-region LMI.
[ "continuous", "sdp", "semidefinite", "control", "source-exact", "source-alternative" ]
imported
aramani-mae-598-lmi-codes
MAE-598-LMI-Codes, InsensitiveDiskRegion.m, commit 55ae1213989e4a58f9c94f417e518de3b4ee697b.
https://github.com/aramani3/MAE-598-LMI-Codes/blob/55ae1213989e4a58f9c94f417e518de3b4ee697b/InsensitiveDiskRegion.m
unknown
optimal
3.888614
0.000001
0.000001
Mosek 11.2.4
optimal
3.888614
0.000521
2026-09-23
ha0-bf/aramani_mae598_insensitive_disk_region_3d.mof.json
ha0-bf/aramani_mae598_insensitive_disk_region_3d.yaml
1,751
f2ac47537ebf4f242fad1b7f9860de9fc712d272ab9a235cd470b3b9f4d2f90f
1
sdp/aramani_mae598_insensitive_strip_region_3d
MAE 598 insensitive strip-region LMI, 3-state source case
sdp
SDP for InsensitiveStripRegion.m. The model uses the fixed A, B, C, controller K, and 3-by-3 strip-region LMI minimizing gamma.
[ "continuous", "sdp", "semidefinite", "control", "source-exact", "source-alternative" ]
imported
aramani-mae-598-lmi-codes
MAE-598-LMI-Codes, InsensitiveStripRegion.m, commit 55ae1213989e4a58f9c94f417e518de3b4ee697b.
https://github.com/aramani3/MAE-598-LMI-Codes/blob/55ae1213989e4a58f9c94f417e518de3b4ee697b/InsensitiveStripRegion.m
unknown
optimal
-2.496096
0.000001
0.000001
Mosek 11.2.4
optimal
-2.496096
0.000349
2026-09-23
h60-7f/aramani_mae598_insensitive_strip_region_3d.mof.json
h60-7f/aramani_mae598_insensitive_strip_region_3d.yaml
1,600
4093097f6d9eed25859c9d2391bf2687b5526b499d39b4848ac5d679748aae03
1
sdp/arbitragelab_sparse_mr_crossing_country_etf_nlags3
ArbitrageLab sparse mean-reverting crossing SDP
sdp
Fixed-data crossing-statistic SDP for 45 international equity ETFs with demeaned prices, rho=0.001, mu=0.01, variance lower bound V=5, nlags=3, and use_standardized=False; the model weights lag one linearly by mu and squares lags two and three.
[ "financial", "mean-reversion", "portfolio", "robust", "semidefinite", "sparse" ]
imported
arbitragelab-sparse-mr
Hudson & Thames, ArbitrageLab, SparseMeanReversionPortfolio crossing SDP test fixture, pinned to commit 32ccd567e8541965a35293a67944945f6d377f65.
https://github.com/hudson-and-thames/arbitragelab/blob/32ccd567e8541965a35293a67944945f6d377f65/arbitragelab/cointegration_approach/sparse_mr_portfolio.py
BSD-3-Clause
optimal
36.778371
0.000001
0.000001
Mosek 11.2.4
optimal
36.778371
0.398066
2026-09-20
he0-ff/arbitragelab_sparse_mr_crossing_country_etf_nlags3.mof.json.zst
he0-ff/arbitragelab_sparse_mr_crossing_country_etf_nlags3.yaml
57,512
6f594a52e473d867c0575fb42e47f2531f45a3b398e68d2a13bf0a55d2a6450b
1
sdp/arbitragelab_sparse_mr_portmanteau_country_etf_nlags3
ArbitrageLab sparse mean-reverting portmanteau SDP
sdp
Fixed-data portmanteau SDP for 45 international equity ETFs with demeaned prices, rho=0.001, variance lower bound V=5, nlags=3, and use_standardized=False, minimizing the three squared autocovariance traces plus the full entrywise l1 penalty.
[ "financial", "mean-reversion", "portfolio", "robust", "semidefinite", "sparse" ]
imported
arbitragelab-sparse-mr
Hudson & Thames, ArbitrageLab, SparseMeanReversionPortfolio portmanteau SDP test fixture, pinned to commit 32ccd567e8541965a35293a67944945f6d377f65.
https://github.com/hudson-and-thames/arbitragelab/blob/32ccd567e8541965a35293a67944945f6d377f65/arbitragelab/cointegration_approach/sparse_mr_portfolio.py
BSD-3-Clause
optimal
58.719023
0.000001
0.000001
Mosek 11.2.4
optimal
58.719023
0.528189
2026-09-20
he0-ff/arbitragelab_sparse_mr_portmanteau_country_etf_nlags3.mof.json.zst
he0-ff/arbitragelab_sparse_mr_portmanteau_country_etf_nlags3.yaml
53,612
5b352babe1e8e70c98a528607f92bd41afe7bd93bc318ced3bc78278891e0229
1
sdp/arbitragelab_sparse_mr_predictability_country_etf
ArbitrageLab sparse mean-reverting predictability SDP
sdp
Fixed-data predictability SDP on 45 international equity ETFs with demeaned prices, rho=0.001, variance lower bound V=5, and use_standardized=False; M=Gamma_1 Cov^-1 Gamma_1^T.
[ "financial", "mean-reversion", "portfolio", "robust", "semidefinite", "sparse" ]
imported
arbitragelab-sparse-mr
Hudson & Thames, ArbitrageLab, SparseMeanReversionPortfolio predictability SDP test fixture, pinned to commit 32ccd567e8541965a35293a67944945f6d377f65.
https://github.com/hudson-and-thames/arbitragelab/blob/32ccd567e8541965a35293a67944945f6d377f65/arbitragelab/cointegration_approach/sparse_mr_portfolio.py
BSD-3-Clause
optimal
4.433421
0.000001
0.000001
Mosek 11.2.4
optimal
4.433421
0.450821
2026-09-20
h20-3f/arbitragelab_sparse_mr_predictability_country_etf.mof.json.zst
h20-3f/arbitragelab_sparse_mr_predictability_country_etf.yaml
34,786
bdecc892e4e080f27db32ef1c2556f20bbfd9e652c47fb981c20c3207e3254c2
1
sdp/armbruster_g124_02_equipartition_sdp
Armbruster G124.02.bis minimum-bisection equipartition SDP
sdp
Sparse G-family equipartition instance with n=124 and 149 unit-cost edges.
[ "continuous", "combinatorial", "graph", "graph-partition", "semidefinite", "equipartition", "armbruster" ]
imported
armbruster-graph-bisection
Michael Armbruster, Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems, TU Chemnitz dissertation, 2007
https://www.tu-chemnitz.de/mathematik/discrete/armbruster/diss/diss_armbruster_instances_and_solutions.zip
unknown (the source catalog records redistribution as unknown)
optimal
7.343071
0.000001
0.000001
Mosek 11.2.4
optimal
7.343071
0.123212
2026-09-20
h80-9f/armbruster_g124_02_equipartition_sdp.mof.json.zst
h80-9f/armbruster_g124_02_equipartition_sdp.yaml
20,440
c2ee74791d22b4b066bf7b70f96a796672dcd9ad5baf12f8ac587eb7d7d281a3
1
sdp/armbruster_g250_01_equipartition_sdp
Armbruster G250.01.bis minimum-bisection equipartition SDP
sdp
Sparse G-family equipartition SDP with n=250 and 331 unit-cost edges.
[ "continuous", "combinatorial", "graph", "graph-partition", "semidefinite", "equipartition", "armbruster" ]
imported
armbruster-graph-bisection
Michael Armbruster, Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems, TU Chemnitz dissertation, 2007
https://www.tu-chemnitz.de/mathematik/discrete/armbruster/diss/diss_armbruster_instances_and_solutions.zip
unknown (the source catalog records redistribution as unknown)
feasible
null
null
null
Mosek 11.2.4
feasible
null
0.864537
2026-09-20
h20-3f/armbruster_g250_01_equipartition_sdp.mof.json.zst
h20-3f/armbruster_g250_01_equipartition_sdp.yaml
77,821
21ee31e90e19bedd61d6b8f2d408d0f63b61ffb0af6097e874c8f88060cd0ce8
1
sdp/armbruster_g500_005_equipartition_sdp
Armbruster G500.005.bis minimum-bisection equipartition SDP
sdp
Sparse G-family equipartition instance with n=500 and 625 unit-cost edges.
[ "continuous", "combinatorial", "graph", "graph-partition", "semidefinite", "equipartition", "armbruster" ]
imported
armbruster-graph-bisection
Michael Armbruster, Branch-and-Cut for a Semidefinite Relaxation of Large-scale Minimum Bisection Problems, TU Chemnitz dissertation, 2007
https://www.tu-chemnitz.de/mathematik/discrete/armbruster/diss/diss_armbruster_instances_and_solutions.zip
unknown (the source catalog records redistribution as unknown)
feasible
null
null
null
null
null
null
null
null
hc0-df/armbruster_g500_005_equipartition_sdp.mof.json.zst
hc0-df/armbruster_g500_005_equipartition_sdp.yaml
244,053
c1d739db13c53453ef9a7e3ff288119ba920e082133579d4f88efe6d17c0a8b5
1
sdp/arxiv2502_qcqp_example24_sdp
Arima et al. finite QCQP SDP relaxation
sdp
Explicit SDP relaxation for q(u)=u1^2+2u1*u2+3u2^2-2u1-2u2 with the five hyperbola matrices B(a,1), a=2,1,0,-1,-2, from Example 2.4.
[ "academic", "imported", "semidefinite" ]
imported
r6-arxiv-2502-15206
Arima et al., arXiv:2502.15206, introduction q(u) and SDP relaxation (Eq. (SDP0)); Example 2.4 defines B(a,r) and G^h={(2,1),(1,1),(0,1),(-1,1),(-2,1)}.
https://arxiv.org/abs/2502.15206
unknown (arXiv paper)
optimal
-1
0.000001
0.000001
Mosek 11.2.4
optimal
-1
0.000607
2026-09-17
h40-5f/arxiv2502_qcqp_example24_sdp.mof.json
h40-5f/arxiv2502_qcqp_example24_sdp.yaml
2,280
3e1bd4677017e1d7fa96d37c1c71022521d1d38458ce52c406f6ccc05c7e5eda
1
sdp/arzelier_lmi_analytic_center_example1
Arzelier LMI notes 3x3 analytic-center example
sdp
Feasibility SDP from Example (1) on pp. 10-11 of the LAAS LMI optimization notes. The PSD affine matrix is the displayed F(x1,x2), including all six numerical entries.
[ "academic", "analytic-center", "continuous", "lmi", "semidefinite", "teaching" ]
imported
arzelier-lmi-optimization-notes
Public source artifact for arzelier-lmi-optimization-notes; numerical constants transcribed from the cited file/repository.
https://homepages.laas.fr/arzelier/polycop/dea/Solving_LMIs.pdf
unknown (course notes; redistribution restricted)
optimal
0
0.000001
0.000001
Mosek 11.2.4
optimal
0
0.000353
2026-09-18
h40-5f/arzelier_lmi_analytic_center_example1.mof.json
h40-5f/arzelier_lmi_analytic_center_example1.yaml
1,715
9518b648ddfc60105c5802dca6944ae1e9ac2b38fcf4092d8f9491e276345b56
1
sdp/asalimil_decentralized_feedback_hinf_lmi
Asalimil decentralized feedback H-infinity LMI
sdp
Fixed 6-state decentralized state-feedback H-infinity SDP from the source MATLAB example. It preserves the source A, B1, B2, C1, D11, D12 matrices, eta=1e-8, structured X/Z sparsity, X >= eta I, and the 12-by-12 bounded-real LMI M <= eta I.
[ "control", "fixed-data", "h-infinity", "imported", "lmi", "semidefinite" ]
imported
asalimil-decentralized-feedback-lmi
LMI_for_decentralized_feedback_controller.m at commit 2725d3bea181c40b8985e58668019e5b07b33059 (SHA-256 d9c67ee9b7802bf9f8691d958acd8c82a587793e30e71f1a03db9248235d45f3).
https://github.com/asalimil/LMI_for_decentralized_feedback_controller
unknown
feasible
null
null
null
Mosek 11.2.4
feasible
null
0.013621
2026-09-20
he0-ff/asalimil_decentralized_feedback_hinf_lmi.mof.json.zst
he0-ff/asalimil_decentralized_feedback_hinf_lmi.yaml
1,480
013228856444f3a0839c1d41ece0c70f67955235dc811f49ba31a7c0d5558d1c
1
sdp/aspire_commonline_sdp_saved_clmatrix64_ntheta36
ASPIRE CommonlineSDP saved cryo-EM common-lines Gram SDP
sdp
ASPIRE-Python CommonlineSDP model for 64 images with n_theta=36. It has a 128-by-128 symmetric Gram PSD constraint, 128 unit-diagonal equalities, 64 cross-block orthogonality equalities, and objective minimize trace(-S G). The integer common-lines matrix defines S through cosine/sine products.
[ "sdp", "semidefinite", "cryo-em", "geometry", "orientation", "common-lines", "imported" ]
imported
aspire-commonline-sdp
ASPIRE-Python, src/aspire/abinitio/commonline_sdp.py and tests/saved_test_data/orient_est_clmatrix.npy, revision 64ad0dd6afb690547ae48cbdbb38bf62525ed8c7. A. Singer and Y. Shkolnisky, Three-Dimensional Structure Determination from Common Lines in Cryo-EM by Eigenvectors and Semidefinite Programming, SIAM J. Imaging Sci...
https://github.com/ComputationalCryoEM/ASPIRE-Python/tree/64ad0dd6afb690547ae48cbdbb38bf62525ed8c7
GPL-3.0
optimal
-2,931.095647
0.000001
0.000001
Mosek 11.2.4
optimal
-2,931.095647
0.035276
2026-09-20
he0-ff/aspire_commonline_sdp_saved_clmatrix64_ntheta36.mof.json.zst
he0-ff/aspire_commonline_sdp_saved_clmatrix64_ntheta36.yaml
49,452
72e7adee2cabb3f1f47c8fefcbc9ff6cc4f82cc37798de245b30f7402d7324ff
1
sdp/asu_mae509_weighted_maxcut5
ASU MAE509 weighted five-node Max-Cut SDP
sdp
The five-node weighted Max-Cut instance printed on p. 14 of Lecture 02 has edges (1,2), (2,3), (4,5), (1,5), and (3,4), each of weight 0.5; the listed zero weights are omitted. This is its standard PSD correlation-matrix relaxation, and the source gives an optimal cut value of 4.
[ "combinatorial", "continuous", "graph", "max-cut", "semidefinite", "sdp", "teaching" ]
imported
asu-mae509-lmi-lecture
Matthew M. Peet, LMI Methods in Optimal and Robust Control, MAE509 Lecture 02: Optimization, Arizona State University, 2023, p. 14.
https://control.asu.edu/Classes/MAE509/509Lecture02.pdf
unknown
optimal
4.522542
0.000001
0.000001
Mosek 11.2.4
optimal
4.522542
0.000481
2026-09-17
h40-5f/asu_mae509_weighted_maxcut5.mof.json
h40-5f/asu_mae509_weighted_maxcut5.yaml
1,749
12fd54d5f846aba8c5571673685bdc5c5b32dfcb9aa6b5f5ce07ce4d5827460e
1
sdp/atamturk_tsdp_ieee118_01
Atamturk TSDP unit relaxation (ieee118_01)
sdp
24-hour third-order semidefinite unit-commitment relaxation for the IEEE 118-bus system, with generator capacity, cost, ramp, initial-state, and minimum up/down data and two 3-by-3 PSD blocks in equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-data
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/IEEE%20118%20AC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
optimal
2,000.465794
0.000001
0.000001
Mosek 11.2.4
optimal
2,000.465794
0.365709
2026-09-20
h80-9f/atamturk_tsdp_ieee118_01.mof.json.zst
h80-9f/atamturk_tsdp_ieee118_01.yaml
212,350
49b05987a06942bd15c87d225812dac806cb7919505d325289a27973a0d4a9da
1
sdp/atamturk_tsdp_ieee118_dc_01
Atamturk TSDP unit relaxation (ieee118_dc_01)
sdp
Deterministic 24-hour third-order semidefinite unit-commitment relaxation for the Atamturk TSDP MATPOWER snapshot. The model retains generator capacity, cost, ramp, initial-state, and minimum up/down data and the two 3-by-3 PSD blocks in equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-tsdp-grid-scheduling
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/IEEE%20118%20DC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
optimal
2,170.398883
0.000001
0.000001
Mosek 11.2.4
optimal
2,170.398883
0.404101
2026-09-20
h60-7f/atamturk_tsdp_ieee118_dc_01.mof.json.zst
h60-7f/atamturk_tsdp_ieee118_dc_01.yaml
209,568
5837105fa69cb7cdfae9be30af3de490e447f42aac4ab528d3efda245889b3ce
1
sdp/atamturk_tsdp_ieee300_01
Atamturk TSDP unit relaxation (ieee300_01)
sdp
24-hour third-order semidefinite unit-commitment relaxation for the IEEE 300-bus system, with generator capacity, cost, ramp, initial-state, and minimum up/down data and two 3-by-3 PSD blocks in equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-data
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/IEEE%20300%20AC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
optimal
4,626.585491
0.000001
0.000001
Mosek 11.2.4
optimal
4,626.585491
0.591793
2026-09-20
h80-9f/atamturk_tsdp_ieee300_01.mof.json.zst
h80-9f/atamturk_tsdp_ieee300_01.yaml
270,521
dea70e8fad3f37631bae6a64aa0286e4f27fe44c221ec3d348e26b1a83202dbe
1
sdp/atamturk_tsdp_ieee300_dc_01
Atamturk TSDP unit relaxation (ieee300_dc_01)
sdp
Deterministic 24-hour third-order semidefinite unit-commitment relaxation for the published Atamturk TSDP MATPOWER snapshot. The model includes generator capacity, cost, ramp, initial-state, and minimum up/down data and the two 3-by-3 PSD blocks in equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-tsdp-grid-scheduling
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/IEEE%20300%20DC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
optimal
5,916.309899
0.000001
0.000001
Mosek 11.2.4
optimal
5,916.309899
0.67442
2026-09-20
ha0-bf/atamturk_tsdp_ieee300_dc_01.mof.json.zst
ha0-bf/atamturk_tsdp_ieee300_dc_01.yaml
272,119
5d89cac7e536f090ad35a35f4c4ba88e2be1bde5a7482051d409319a468711a2
1
sdp/atamturk_tsdp_pegase1354_01
Atamturk TSDP unit relaxation (pegase1354_01)
sdp
Deterministic 24-hour third-order semidefinite unit-commitment relaxation. It includes generator capacity, cost, ramp, initial-state, and minimum up/down constraints, with two 3-by-3 PSD blocks from equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-data
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/PEGASE%201354%20AC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
optimal
14,509.696219
0.000001
0.000001
Mosek 11.2.4
optimal
14,509.696219
2.858441
2026-09-20
h00-1f/atamturk_tsdp_pegase1354_01.mof.json.zst
h00-1f/atamturk_tsdp_pegase1354_01.yaml
770,887
b69e0ec77681b3977a0a93c7dc3701959f5a4e26d8e77c5fbdf3c1a5455415f1
1
sdp/atamturk_tsdp_pegase1354_dc_01
Atamturk TSDP unit relaxation (pegase1354_dc_01)
sdp
Deterministic 24-hour third-order semidefinite unit-commitment relaxation for the Atamturk TSDP MATPOWER snapshot. The model retains generator capacity, cost, ramp, initial-state, and minimum up/down data and the two 3-by-3 PSD blocks in equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-tsdp-grid-scheduling
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/PEGASE%201354%20DC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
optimal
17,335.627821
0.000001
0.000001
Mosek 11.2.4
optimal
17,335.627821
3.035414
2026-09-20
h60-7f/atamturk_tsdp_pegase1354_dc_01.mof.json.zst
h60-7f/atamturk_tsdp_pegase1354_dc_01.yaml
770,287
c1515d917d044d2aa1f9aefa29aafc197d3e895b89f23e451b498c7ae9a1e36a
1
sdp/atamturk_tsdp_pegase2869_ac_01
Atamturk TSDP unit relaxation (pegase2869_ac_01)
sdp
24-hour third-order semidefinite unit-commitment relaxation for the PEGASE 2869-bus AC system, with generator capacity, cost, ramp, initial-state, and minimum up/down data and two 3-by-3 PSD blocks in equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-tsdp-grid-scheduling
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/PEGASE%202869%20AC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
optimal
26,101.056687
0.000001
0.000001
Mosek 11.2.4
optimal
26,101.056687
7.383764
2026-09-20
h80-9f/atamturk_tsdp_pegase2869_ac_01.mof.json.zst
h80-9f/atamturk_tsdp_pegase2869_ac_01.yaml
1,568,831
114087d4b2ab746a5dfa4d231d23a03647fbba469721be7e6471eb79fcee72d9
1
sdp/atamturk_tsdp_pegase2869_dc_01
Atamturk TSDP unit relaxation (pegase2869_dc_01)
sdp
Deterministic 24-hour third-order semidefinite unit-commitment relaxation for PEGASE2869. It includes generator capacity, cost, ramp, initial-state, and minimum up/down data and two 3-by-3 PSD blocks in equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-tsdp-grid-scheduling
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/PEGASE%202869%20DC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
optimal
34,138.217205
0.000001
0.000001
Mosek 11.2.4
optimal
34,138.217205
6.926078
2026-09-20
hc0-df/atamturk_tsdp_pegase2869_dc_01.mof.json.zst
hc0-df/atamturk_tsdp_pegase2869_dc_01.yaml
1,564,595
2089cce633ea2dda7965193cb66b6126e17bfa04e6dd135b5466daf29ea95559
1
sdp/atamturk_tsdp_pegase9241_ac_01
Atamturk TSDP unit relaxation (pegase9241_ac_01)
sdp
Deterministic 24-hour third-order semidefinite unit-commitment relaxation. It includes generator capacity, cost, ramp, initial-state, and minimum up/down constraints, with two 3-by-3 PSD blocks from equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-tsdp-grid-scheduling
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/PEGASE%209241%20AC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
feasible
null
null
null
Mosek 11.2.4
feasible
null
27.451998
2026-09-21
h00-1f/atamturk_tsdp_pegase9241_ac_01.mof.json.zst
h00-1f/atamturk_tsdp_pegase9241_ac_01.yaml
4,583,001
0b741d7cd54b39567cb43726d8a646f0e150184e07f3e6c893d1129dd4ed07d3
1
sdp/atamturk_tsdp_pegase9241_dc_01
Atamturk TSDP unit relaxation (pegase9241_dc_01)
sdp
Deterministic 24-hour third-order semidefinite unit-commitment relaxation with generator capacity, cost, ramp, initial-state, and minimum up/down data and two 3-by-3 PSD blocks in equations (14a-b).
[ "continuous", "imported", "power-grid", "sdp", "unit-commitment", "semidefinite" ]
imported
atamturk-tsdp-grid-scheduling
R. Madani, A. Atamturk, and A. Davoudi, Scalable Unit Commitment with AC Power Flow via Semidefinite Programming Relaxation, BCOL Research Report 17.03 (2017), deterministic TSDP archive snapshot.
https://atamturk.ieor.berkeley.edu/data/tsdp/PEGASE%209241%20DC/01_TSDP.mat.gz
MIT (Atamturk data repository readme)
optimal
94,537.714143
0.000001
0.000001
Mosek 11.2.4
optimal
94,537.714143
26.563465
2026-09-24
h20-3f/atamturk_tsdp_pegase9241_dc_01.mof.json.zst
h20-3f/atamturk_tsdp_pegase9241_dc_01.yaml
4,585,578
349045bb76d00baee9c296da691c3b342834815b76755c1f39b5c7d0a94eec77
1
sdp/atomic_norm_boxcar_mmv_m100_n6_source_derived
Atomic norm modal-analysis MMV SDP for the six-DOF boxcar system
sdp
Synthetic analytic samples for a fully specified undamped six-degree-of-freedom boxcar system, with the system masses, springs, 100 uniform samples, sampling rule, and modal amplitudes. The eigenvector signs use a deterministic convention.
[ "sdp", "atomic-norm", "modal-analysis", "source-derived-synthetic", "review-only" ]
source_derived_synthetic
atomic-norm-modal-analysis
Atomic norm modal-analysis MMV SDP for the six-DOF boxcar system
https://arxiv.org/abs/1703.00938
unknown
optimal
3.4
0.000001
0.000001
Mosek 11.2.4
optimal
3.4
129.201796
2026-09-23
h20-3f/atomic_norm_boxcar_mmv_m100_n6_source_derived.mof.json.zst
h20-3f/atomic_norm_boxcar_mmv_m100_n6_source_derived.yaml
31,855
ffe4987566b68397d725b9652bed9d0542db081a24fdb1a6840751323554efdd
1
sdp/atomic_norm_line_spectral_atom_n8
Atomic norm line-spectrum SDP (n=8 atom)
sdp
Explicit atomic-norm SDP from Bhaskar, Tang, and Recht, with n=8 and the source atom at normalized frequency f=1/8 and phase phi=1/4. The numerical vector x is exactly one unit-norm line-spectrum atom, and the Hermitian Toeplitz Gram block is positive semidefinite.
[ "continuous", "line-spectrum", "signal-processing", "semidefinite", "toeplitz" ]
imported
atomic-norm-line-spectral
B. N. Bhaskar, G. Tang, and B. Recht, Atomic norm denoising with applications to line spectral estimation, arXiv:1204.0562, Section 3.
https://arxiv.org/abs/1204.0562
unknown
optimal
1
0.000001
0.000001
Mosek 11.2.4
optimal
1
0.002827
2026-09-17
h80-9f/atomic_norm_line_spectral_atom_n8.mof.json
h80-9f/atomic_norm_line_spectral_atom_n8.yaml
5,929
e9d791f177a04cf115ca1d4c72662844c905f56bba26f739a5270ddba2ccb58e
1
sdp/au_tuncel_lsplus2_g17_2
Au–Tunçel LS+ obstruction SDP (G_17_2)
sdp
Normalized Lovasz-Schrijver LS+ relaxation for the G_17_2 13-vertex obstruction graph (26 edges). The SDP maximizes the published facet's left-hand side. The source provides an LS+^2 certificate; its witness also lies in this level-1 LS+ feasible region and exceeds the facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.715436
0.000001
0.000001
Mosek 11.2.4
optimal
4.715436
0.050749
2026-09-23
hc0-df/au_tuncel_lsplus2_g17_2.mof.json.zst
hc0-df/au_tuncel_lsplus2_g17_2.yaml
5,825
fd3ec92c2ee58bdadd821d1a29bedd5d5d7307a9bfd47b3ff0a97ea326c3643b
1
sdp/au_tuncel_lsplus2_g7_1
Au–Tunçel LS+ obstruction SDP (G_7_1)
sdp
Normalized Lovasz-Schrijver LS+ relaxation for the G_7_1 9-vertex obstruction graph (18 edges). The SDP maximizes the published facet's left-hand side. The source provides an LS+^2 certificate; its witness also lies in this level-1 LS+ feasible region and exceeds the facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
3.041667
0.000001
0.000001
Mosek 11.2.4
optimal
3.041667
0.025859
2026-09-23
h20-3f/au_tuncel_lsplus2_g7_1.mof.json.zst
h20-3f/au_tuncel_lsplus2_g7_1.yaml
2,608
601f8c71da5b19f222a052db2a672d7ea072382aa431aa5446ff5164dc7b5d43
1
sdp/au_tuncel_lsplus2_g7_2
Au–Tunçel LS+ obstruction SDP (G_7_2)
sdp
Normalized Lovasz-Schrijver LS+ relaxation for the G_7_2 9-vertex obstruction graph (16 edges). The SDP maximizes the published facet's left-hand side. The source provides an LS+^2 certificate; its witness also lies in this level-1 LS+ feasible region and exceeds the facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
3.064586
0.000001
0.000001
Mosek 11.2.4
optimal
3.064586
0.017911
2026-09-23
ha0-bf/au_tuncel_lsplus2_g7_2.mof.json.zst
ha0-bf/au_tuncel_lsplus2_g7_2.yaml
2,589
80891f8cc1edd81f7ff619b4dcebeb88c61084990036d1546efa90481f1e1879
1
sdp/au_tuncel_lsplus2_g7_3
Au–Tunçel LS+ obstruction SDP (G_7_3)
sdp
Normalized Lovasz-Schrijver LS+ relaxation for the G_7_3 9-vertex obstruction graph (18 edges). The SDP maximizes the published facet's left-hand side. The source provides an LS+^2 certificate; its witness also lies in this level-1 LS+ feasible region and exceeds the facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
3.096828
0.000001
0.000001
Mosek 11.2.4
optimal
3.096828
0.021642
2026-09-23
ha0-bf/au_tuncel_lsplus2_g7_3.mof.json.zst
ha0-bf/au_tuncel_lsplus2_g7_3.yaml
2,903
3c04fe3981cf78804e99c6c9b195611df3c1487bf9d26ca00fa2bd3d7494faf2
1
sdp/au_tuncel_lsplus2_g7_4
Au–Tunçel LS+ obstruction SDP (G_7_4)
sdp
Normalized Lovasz-Schrijver LS+ relaxation for the G_7_4 9-vertex obstruction graph (19 edges). The SDP maximizes the published facet's left-hand side. The source provides an LS+^2 certificate; its witness also lies in this level-1 LS+ feasible region and exceeds the facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
3.085299
0.000001
0.000001
Mosek 11.2.4
optimal
3.085299
0.025148
2026-09-23
he0-ff/au_tuncel_lsplus2_g7_4.mof.json.zst
he0-ff/au_tuncel_lsplus2_g7_4.yaml
2,640
2baedb3ebed0d12b1f83b325595e01ec09f181d61dad5766aec597076f9edfb3
1
sdp/au_tuncel_lsplus2_g7_5
Au–Tunçel LS+ obstruction SDP (G_7_5)
sdp
Normalized Lovasz-Schrijver LS+ relaxation for the G_7_5 9-vertex obstruction graph (18 edges). The SDP maximizes the published facet's left-hand side. The source provides an LS+^2 certificate; its witness also lies in this level-1 LS+ feasible region and exceeds the facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
3.138951
0.000001
0.000001
Mosek 11.2.4
optimal
3.138951
0.021596
2026-09-23
h80-9f/au_tuncel_lsplus2_g7_5.mof.json.zst
h80-9f/au_tuncel_lsplus2_g7_5.yaml
2,614
8d208050cbb36ecf4e4df2214163a952f0d7eb1b54f0934f634b6b1983eab883
1
sdp/au_tuncel_lsplus2_g7_6
Au–Tunçel LS+ obstruction SDP (G_7_6)
sdp
Normalized Lovasz-Schrijver LS+ relaxation for the G_7_6 9-vertex obstruction graph (17 edges). The SDP maximizes the published facet's left-hand side. The source provides an LS+^2 certificate; its witness also lies in this level-1 LS+ feasible region and exceeds the facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
3.142864
0.000001
0.000001
Mosek 11.2.4
optimal
3.142864
0.026122
2026-09-23
hc0-df/au_tuncel_lsplus2_g7_6.mof.json.zst
hc0-df/au_tuncel_lsplus2_g7_6.yaml
2,496
6bfb1afe6a75050dc6858e66c3d3974e9eab23cfa7b848d3ac87ed08f43510d4
1
sdp/au_tuncel_lsplus2_g7_7
Au–Tunçel LS+ obstruction SDP (G_7_7)
sdp
Normalized Lovasz-Schrijver LS+ relaxation for the G_7_7 9-vertex obstruction graph (17 edges). The SDP maximizes the published facet's left-hand side. The source provides an LS+^2 certificate; its witness also lies in this level-1 LS+ feasible region and exceeds the facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
3.041667
0.000001
0.000001
Mosek 11.2.4
optimal
3.041667
0.025054
2026-09-23
h20-3f/au_tuncel_lsplus2_g7_7.mof.json.zst
h20-3f/au_tuncel_lsplus2_g7_7.yaml
2,641
06169d8e79f63516615db769e61d225d3b2f6f136e3b068dcb3c5a949253da11
1
sdp/au_tuncel_lsplus2_g7_8
Au–Tunçel LS+ obstruction SDP (G_7_8)
sdp
Normalized Lovasz-Schrijver LS+ relaxation for the G_7_8 9-vertex obstruction graph (19 edges). The SDP maximizes the published facet's left-hand side. The source provides an LS+^2 certificate; its witness also lies in this level-1 LS+ feasible region and exceeds the facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
3.07772
0.000001
0.000001
Mosek 11.2.4
optimal
3.07772
0.027564
2026-09-23
h00-1f/au_tuncel_lsplus2_g7_8.mof.json.zst
h00-1f/au_tuncel_lsplus2_g7_8.yaml
2,680
b62f007bd7dd5898087627e6a3ac93be12999af808f1986e6ba0ff9944dbef42
1
sdp/au_tuncel_lsplus3_1028130
Au–Tunçel LS+ obstruction SDP (1028130)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1028130 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.132297
0.000001
0.000001
Mosek 11.2.4
optimal
4.132297
0.06157
2026-09-20
hc0-df/au_tuncel_lsplus3_1028130.mof.json.zst
hc0-df/au_tuncel_lsplus3_1028130.yaml
5,389
9d895df1a957af60faa2d918326b845be5c524b1b23ced8168f3e6d4c1ac5259
1
sdp/au_tuncel_lsplus3_1028857
Au–Tunçel LS+ obstruction SDP (1028857)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1028857 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.127807
0.000001
0.000001
Mosek 11.2.4
optimal
4.127807
0.064839
2026-09-20
hc0-df/au_tuncel_lsplus3_1028857.mof.json.zst
hc0-df/au_tuncel_lsplus3_1028857.yaml
5,385
221ef4846ee10c5799d02ee6c9b9a8cd5a3d811e6f73a332065372c060241b79
1
sdp/au_tuncel_lsplus3_1033313
Au–Tunçel LS+ obstruction SDP (1033313)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1033313 12-vertex obstruction graph (25 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.128068
0.000001
0.000001
Mosek 11.2.4
optimal
4.128068
0.05667
2026-09-20
he0-ff/au_tuncel_lsplus3_1033313.mof.json.zst
he0-ff/au_tuncel_lsplus3_1033313.yaml
5,344
02dc91f57b42aade02f9e50d6cdb9802295f93e9e575ccbfcc575044daca6a54
1
sdp/au_tuncel_lsplus3_1033564
Au–Tunçel LS+ obstruction SDP (1033564)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1033564 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.195305
0.000001
0.000001
Mosek 11.2.4
optimal
4.195305
0.065537
2026-09-20
h00-1f/au_tuncel_lsplus3_1033564.mof.json.zst
h00-1f/au_tuncel_lsplus3_1033564.yaml
5,407
3f1448055161c1921e45f0a2f7735b7964391f3316d6014555b7a75d493bf033
1
sdp/au_tuncel_lsplus3_1033639
Au–Tunçel LS+ obstruction SDP (1033639)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1033639 12-vertex obstruction graph (25 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.127885
0.000001
0.000001
Mosek 11.2.4
optimal
4.127885
0.055139
2026-09-20
h00-1f/au_tuncel_lsplus3_1033639.mof.json.zst
h00-1f/au_tuncel_lsplus3_1033639.yaml
5,299
7e02c9f083a583512fb2d481c8575a548d2734fd2eaeb28dd3ac822bd65dddff
1
sdp/au_tuncel_lsplus3_1034155
Au–Tunçel LS+ obstruction SDP (1034155)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1034155 12-vertex obstruction graph (25 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.127885
0.000001
0.000001
Mosek 11.2.4
optimal
4.127885
0.053393
2026-09-20
ha0-bf/au_tuncel_lsplus3_1034155.mof.json.zst
ha0-bf/au_tuncel_lsplus3_1034155.yaml
5,299
0586da0f27fd2f171ed83794c2ed263348998bfacbd10f35175cb0659cc3cd74
1
sdp/au_tuncel_lsplus3_1037826
Au–Tunçel LS+ obstruction SDP (1037826)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1037826 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.127338
0.000001
0.000001
Mosek 11.2.4
optimal
4.127338
0.060037
2026-09-20
h00-1f/au_tuncel_lsplus3_1037826.mof.json.zst
h00-1f/au_tuncel_lsplus3_1037826.yaml
5,424
faa8138f824dce4ae9b6a31adf18da38ec7ee8786b4fccb9fbf10af222f579e4
1
sdp/au_tuncel_lsplus3_1044525
Au–Tunçel LS+ obstruction SDP (1044525)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1044525 12-vertex obstruction graph (27 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.188609
0.000001
0.000001
Mosek 11.2.4
optimal
4.188609
0.062533
2026-09-20
h60-7f/au_tuncel_lsplus3_1044525.mof.json.zst
h60-7f/au_tuncel_lsplus3_1044525.yaml
5,563
e5f4a8b656419aeee7c91cca61b527f7d06a98d030647e1f15f69e71fd557b6f
1
sdp/au_tuncel_lsplus3_1044823
Au–Tunçel LS+ obstruction SDP (1044823)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1044823 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.180205
0.000001
0.000001
Mosek 11.2.4
optimal
4.180205
0.065338
2026-09-20
h80-9f/au_tuncel_lsplus3_1044823.mof.json.zst
h80-9f/au_tuncel_lsplus3_1044823.yaml
5,415
a08ac83f830ef7b1ad1e14486241e806280e98074cc82b09ddde644793b93c94
1
sdp/au_tuncel_lsplus3_1049488
Au–Tunçel LS+ obstruction SDP (1049488)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1049488 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.129208
0.000001
0.000001
Mosek 11.2.4
optimal
4.129208
0.060466
2026-09-20
h80-9f/au_tuncel_lsplus3_1049488.mof.json.zst
h80-9f/au_tuncel_lsplus3_1049488.yaml
5,276
c14deb8332daabffb821d3a84b49c6e4d8339a5d0d727badec491e6779c4995a
1
sdp/au_tuncel_lsplus3_1049612
Au–Tunçel LS+ obstruction SDP (1049612)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1049612 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.12838
0.000001
0.000001
Mosek 11.2.4
optimal
4.12838
0.062186
2026-09-20
h20-3f/au_tuncel_lsplus3_1049612.mof.json.zst
h20-3f/au_tuncel_lsplus3_1049612.yaml
5,467
00a70f1b0a91ec40d72458e11aaa2f2ccab8ceca21974e237c01da610d331816
1
sdp/au_tuncel_lsplus3_1049626
Au–Tunçel LS+ obstruction SDP (1049626)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1049626 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.187038
0.000001
0.000001
Mosek 11.2.4
optimal
4.187038
0.058041
2026-09-20
ha0-bf/au_tuncel_lsplus3_1049626.mof.json.zst
ha0-bf/au_tuncel_lsplus3_1049626.yaml
5,479
80d249873e31c029b5d03c0242f23d1ffd6725ae8a64aab7b0e5cc0b1c2b2c3f
1
sdp/au_tuncel_lsplus3_1049680
Au–Tunçel LS+ obstruction SDP (1049680)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1049680 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.122825
0.000001
0.000001
Mosek 11.2.4
optimal
4.122825
0.065341
2026-09-20
he0-ff/au_tuncel_lsplus3_1049680.mof.json.zst
he0-ff/au_tuncel_lsplus3_1049680.yaml
5,303
92b22dc9e070b5ac8cc6e1b9cc853e16fab4972a0955b0b0cc6a130a67f844d5
1
sdp/au_tuncel_lsplus3_1050108
Au–Tunçel LS+ obstruction SDP (1050108)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1050108 12-vertex obstruction graph (26 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.150921
0.000001
0.000001
Mosek 11.2.4
optimal
4.150921
0.069844
2026-09-20
hc0-df/au_tuncel_lsplus3_1050108.mof.json.zst
hc0-df/au_tuncel_lsplus3_1050108.yaml
5,456
88133d32219e3ba2bfef4ac3190b7bfc6ac22e00270a234c16b84039ebf8d578
1
sdp/au_tuncel_lsplus3_1050311
Au–Tunçel LS+ obstruction SDP (1050311)
sdp
Normalized Lovász–Schrijver LS+ relaxation for the 1050311 12-vertex obstruction graph (27 edges). The SDP maximizes the published facet value; the source certificate is a feasible point that exceeds that facet's stable-set bound.
[ "continuous", "graph", "imported", "lsplus", "obstruction", "sdp", "semidefinite" ]
imported
au-tuncel-lsplus-obstruction-graphs
Yu Hin Au and Levent Tunçel, Dataset for ‘A Computational Search for Minimal Obstruction Graphs for the Lovász–Schrijver SDP Hierarchy’, Zenodo record 15483991 (2025).
https://doi.org/10.5281/zenodo.15483991
CC-BY-4.0
optimal
4.150921
0.000001
0.000001
Mosek 11.2.4
optimal
4.150921
0.07871
2026-09-20
h40-5f/au_tuncel_lsplus3_1050311.mof.json.zst
h40-5f/au_tuncel_lsplus3_1050311.yaml
5,605
4cf40405871238ee108ea025cdaf126466d6bb32dc7cfc113155b22a9775d891
End of preview. Expand in Data Studio

MathOptDataset SDP

Instance overview in Spaces Solver results in Spaces

Semidefinite optimization instances in MathOptFormat 1.9. Each instance is a model file (<name>.mof.json, or <name>.mof.json.zst when compressed with zstd) paired with a YAML sidecar (<name>.yaml) holding its metadata. Pairs live in hash-range directories (h00-1f/ through he0-ff/) and have sdp/<name> identifiers. metadata/instances.parquet indexes every pair.

Browse provenance, cone structure, scale, and solver results for every instance in the interactive overview. The solver results compare recorded solver runs by outcome, accuracy against the documented references, speed, and disagreements between solvers.

Using the dataset

The default dataset contains metadata only. model_path and sidecar_path are relative repository paths, not automatically downloaded attachments.

from datasets import load_dataset
from huggingface_hub import HfApi, hf_hub_download

repo = "yuanchenyang/mathoptdataset-sdp"
revision = HfApi().dataset_info(repo).sha
rows = load_dataset(repo, split="instances", revision=revision)
selected = rows.filter(lambda row: "control" in row["tags"])
for row in selected:
    path = hf_hub_download(repo, row["model_path"],
                           repo_type="dataset", revision=revision)

Downloads are cached. .zst models require zstandard decompression before parsing as JSON. model_sha256 hashes the stored bytes, including compression; model_size_bytes likewise measures the stored file. Pin metadata and model downloads to the same commit. To obtain original metadata, download sidecar_path in the same way.

Julia

Read one instance's metadata, then load and solve its model with JuMP and the open-source Clarabel solver (] add JuMP Clarabel CodecZstd YAML):

using Downloads, YAML, CodecZstd, JuMP, Clarabel

base = "https://huggingface.co/datasets/yuanchenyang/mathoptdataset-sdp/resolve/main"
name = "hc0-df/ai_hilbert_i3322_sos_bound"
getbytes(path) = take!(Downloads.download("$base/$path", IOBuffer()))

meta = YAML.load(String(getbytes("$name.yaml")))
println(meta["title"], " (", meta["provenance"]["license"], ")")
println("recorded: ", meta["solution"]["status"], " ", meta["solution"]["objective"])

source = MOI.FileFormats.Model(format = MOI.FileFormats.FORMAT_MOF)
read!(IOBuffer(transcode(ZstdDecompressor, getbytes("$name.mof.json.zst"))), source)
model = Model(Clarabel.Optimizer)
MOI.copy_to(model, source)
set_silent(model)
optimize!(model)
println(termination_status(model), " ", objective_value(model))

Uncompressed .mof.json models can be read with read_from_file(path) directly. Recorded solution_ results, where present, come from MOSEK; other solvers may need tolerances adjusted on harder instances.

Metadata

YAML sidecars are authoritative; metadata/instances.parquet is generated. Identity, descriptions, and tags are preserved. Provenance fields become provenance_kind, source_id, citation, source_url, and license. Expected outcomes use expected_ columns; solver observations use solution_ columns. Missing values are null. Dates remain source strings. The single instances split implies no training/evaluation partition.

Provenance and licensing

The card's license: other reflects that licenses differ by instance; consult each row's license, citation, and source URL. This collection has no blanket MIT license. It includes entries with unknown, noncommercial, copyleft, or otherwise restrictive terms. Inclusion here does not grant permission to redistribute an upstream instance; check each instance's terms before reuse.

Downloads last month
167

Spaces using yuanchenyang/mathoptdataset-sdp 2