{"id":"W2785023074","doi":"10.1109/pesgm40551.2019.8974134","title":"Tight-and-Cheap Conic Relaxation for the AC Optimal Power Flow Problem","year":2018,"lang":"en","type":"article","venue":"","topic":"Optimal Power Flow Distribution","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Hydro-Québec","keywords":"Conic optimization; Relaxation (psychology); Conic section; Semidefinite programming; Mathematics; Quadratically constrained quadratic program; Positive-definite matrix; Mathematical optimization; Linearization; Second-order cone programming; Regular polygon; Convex optimization; Quadratic equation; Applied mathematics; Quadratic programming; Convex combination; Geometry; Physics; Nonlinear system; Quantum mechanics","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.0001669162,0.0001057354,0.00008015164,0.0000200351,0.0001055019,0.0000494908,0.00008408914,0.00007533131,0.00023812],"category_scores_gemma":[0.00003007277,0.00007454304,0.00003617466,0.0000794722,0.00005684165,0.0001539808,0.00002172316,0.00007828002,0.0001293111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005169949,"about_ca_system_score_gemma":0.00001157906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004333289,"about_ca_topic_score_gemma":0.000008708978,"domain_scores_codex":[0.9994379,0.000006482514,0.0001392861,0.0001281827,0.00008144022,0.0002066545],"domain_scores_gemma":[0.9996334,0.00006835534,0.00001830498,0.0001586103,0.00008125571,0.00004006438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005280434,0.0002255712,0.001175901,0.0004690707,0.001028089,0.000003956132,0.004207688,0.09694811,0.06177598,0.1472621,0.6105058,0.07586974],"study_design_scores_gemma":[0.000730442,0.0003346097,0.002722926,0.00002016435,0.00005076893,0.000008767574,0.0000914247,0.8650841,0.01299536,0.0005006971,0.117171,0.0002897454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1085128,0.0004627006,0.8631575,0.001308535,0.0009044866,0.001138104,0.00006986722,0.0007128972,0.02373311],"genre_scores_gemma":[0.980325,0.00001698069,0.01891955,0.00005494749,0.0001271205,0.00006209219,0.00003174981,0.00002302574,0.0004395799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8718121,"threshold_uncertainty_score":0.3039777,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007546882933354928,"score_gpt":0.2173088875902662,"score_spread":0.2097620046569112,"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."}}