{"id":"W2158898601","doi":"10.1287/moor.1100.0473","title":"On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Semidefinite programming; Quadratically constrained quadratic program; Mathematics; Semidefinite embedding; Quadratic growth; Quadratic programming; Relaxation (psychology); Equivalence (formal languages); Positive-definite matrix; Mathematical optimization; Second-order cone programming; Matrix (chemical analysis); Quadratic equation; Representation (politics); Applied mathematics; Discrete mathematics; Algorithm; Convex optimization","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0004542421,0.00007780576,0.0001611001,0.0002604545,0.00009597516,0.00002155558,0.0002022129,0.00005260148,0.00003619876],"category_scores_gemma":[0.0004894833,0.0000716327,0.00005104381,0.0002856608,0.00009669329,0.00007768512,0.000034704,0.0001279996,0.00001020644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002168563,"about_ca_system_score_gemma":0.00003246883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002347353,"about_ca_topic_score_gemma":0.00001484846,"domain_scores_codex":[0.9991018,0.00002883567,0.0003392018,0.0000922186,0.0002590791,0.0001788493],"domain_scores_gemma":[0.9987792,0.0003634225,0.00002668648,0.000365875,0.0004333149,0.00003147139],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002049468,0.0006560161,0.00003843007,0.001126824,0.0001103732,0.000002130881,0.009996678,0.0311029,0.09184277,0.8608315,0.001901373,0.002370511],"study_design_scores_gemma":[0.0002294757,0.0004867443,0.00003670512,0.0007548045,0.00002567715,0.000004215363,0.00094433,0.4853562,0.4550013,0.05685236,0.0001246851,0.0001834805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5513864,0.0001624606,0.4338057,0.00003882213,0.00006170909,0.001519095,0.00003571079,0.0002477431,0.01274243],"genre_scores_gemma":[0.7331203,0.0000229527,0.266572,0.000001044507,0.000007527212,0.0001197149,0.000004204177,0.00001882143,0.000133532],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8039792,"threshold_uncertainty_score":0.2921097,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2219451499796543,"score_gpt":0.4008517452339596,"score_spread":0.1789065952543053,"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."}}