{"id":"W2023710022","doi":"10.1016/s0166-218x(01)00352-3","title":"Semidefinite programming for discrete optimization and matrix completion problems","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Lagrangian relaxation; Matrix completion; Relaxation (psychology); Mathematical optimization; Euclidean geometry; Matrix (chemical analysis); Euclidean distance matrix; Maximum cut; Optimization problem; Positive-definite matrix; Combinatorics; Eigenvalues and eigenvectors","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003116964,0.002267702,0.001988494,0.0009917713,0.0007707132,0.00305029,0.001682256,0.001797431,0.006369052],"category_scores_gemma":[0.0101977,0.0008785161,0.001056735,0.002689232,0.003138272,0.004196599,0.001838561,0.007182457,0.001272071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001669473,"about_ca_system_score_gemma":0.00177782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002354946,"about_ca_topic_score_gemma":0.002931323,"domain_scores_codex":[0.9983051,0.0008724264,0.00007434835,0.0002395734,0.0004240625,0.0000844506],"domain_scores_gemma":[0.9937897,0.004532657,0.0004581278,0.0003544529,0.0006372891,0.0002277444],"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.00007782064,0.0001666357,0.0001370679,0.0004080486,0.00005569085,0.00007959897,0.0001536498,0.08748937,0.00113248,0.861383,0.01134815,0.03756862],"study_design_scores_gemma":[0.00002726429,0.00004109149,0.00008364647,0.00003160461,0.00001159854,0.00004132087,0.00003834212,0.3336725,0.0002231843,0.6606433,0.00516699,0.00001911509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004914912,0.002607841,0.9782734,0.001704342,0.0003123579,0.00005174441,0.0002525485,0.0001162482,0.01176663],"genre_scores_gemma":[0.3384442,0.01337525,0.5957439,0.001522138,0.002306814,0.00125614,0.001561563,0.0005455312,0.04524441],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006369052,"threshold_uncertainty_score":0.02130663,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06678160909610262,"score_gpt":0.3380575190064754,"score_spread":0.2712759099103728,"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."}}