{"id":"W2563370187","doi":"10.1007/s13675-018-0101-2","title":"Alternative SDP and SOCP approximations for polynomial optimization","year":2018,"lang":"en","type":"article","venue":"EURO Journal on Computational Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"Division of Civil, Mechanical and Manufacturing Innovation","keywords":"Semidefinite programming; Set (abstract data type); Polynomial; Explained sum of squares; Linear programming; Optimization problem; Second-order cone programming","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005988026,0.0002518697,0.0002603165,0.0004854424,0.0008812897,0.0002935758,0.000205553,0.00009717324,0.0002628697],"category_scores_gemma":[0.001547876,0.0002474593,0.00008940794,0.0004362482,0.0001897634,0.0006594807,0.00006067946,0.0002697929,0.00001354696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001846854,"about_ca_system_score_gemma":0.0001622676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.977019e-7,"about_ca_topic_score_gemma":4.815045e-7,"domain_scores_codex":[0.9978311,0.0001946517,0.0006406059,0.0003753245,0.0006370893,0.0003212023],"domain_scores_gemma":[0.9962019,0.001112623,0.0005121488,0.0001501106,0.001818379,0.0002048325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001827867,0.0001396858,0.000009705452,0.00001902845,0.00005308321,0.000002376857,0.0002773938,0.9776669,0.000003234829,0.01761979,0.002192539,0.001833459],"study_design_scores_gemma":[0.001905211,0.000462994,0.00002301713,0.00004948814,0.00002506675,0.00008881429,0.00005316057,0.9559799,0.000050269,0.04038565,0.0007427785,0.0002336169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004405944,0.00002056454,0.9957344,0.001645542,0.0004572623,0.0007031211,0.00005329251,0.00009337439,0.0008518404],"genre_scores_gemma":[0.01118565,0.00005385902,0.9864866,0.0004492403,0.001094415,0.00004250259,0.0001301408,0.00008285495,0.0004746919],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02276586,"threshold_uncertainty_score":0.9999978,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06303692224109246,"score_gpt":0.3769473133425741,"score_spread":0.3139103911014817,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}