{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01054057,0.003082297,0.001506131,0.001804239,0.0009406041,0.003291139,0.002176272,0.001900184,0.009831076],"category_scores_gemma":[0.03878025,0.000873388,0.001637262,0.002042141,0.004492202,0.006278197,0.004646107,0.009406665,0.001563112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002220638,"about_ca_system_score_gemma":0.001354037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001224451,"about_ca_topic_score_gemma":0.001067187,"domain_scores_codex":[0.993601,0.002982893,0.0002555676,0.0007786982,0.0017489,0.0006328592],"domain_scores_gemma":[0.967662,0.02631798,0.001811666,0.001336383,0.002024366,0.0008475761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002540539,0.0004122444,0.0004779775,0.0004393629,0.00006713532,0.0001847769,0.0004812623,0.1669059,0.002919661,0.7718031,0.005893407,0.05016105],"study_design_scores_gemma":[0.00005279481,0.0002703164,0.0002841444,0.0001110869,0.00002155672,0.0001046582,0.0001368133,0.5318713,0.001305794,0.4625102,0.003293248,0.00003802236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01464768,0.0008564943,0.9617772,0.001162693,0.0001398499,0.0001251192,0.0001745222,0.0001672591,0.02094931],"genre_scores_gemma":[0.5153739,0.003641939,0.4603963,0.001982077,0.001054821,0.001112418,0.001054777,0.0008382873,0.01454547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01054057,"threshold_uncertainty_score":0.05574453,"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."}}