{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219154,0.001325455,0.0009257169,0.0004868769,0.0004513614,0.001246175,0.0006135543,0.0008906786,0.01816744],"category_scores_gemma":[0.003614782,0.0003638458,0.0005202137,0.0009431819,0.000737482,0.001002773,0.0009523101,0.00275234,0.002617765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008501865,"about_ca_system_score_gemma":0.001603035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003256216,"about_ca_topic_score_gemma":0.003918583,"domain_scores_codex":[0.9994583,0.0002185588,0.00002201397,0.0001038418,0.0001308713,0.0000664855],"domain_scores_gemma":[0.9985443,0.0009509189,0.0001021071,0.0001383699,0.0002022282,0.00006197631],"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.0002010818,0.0001802488,0.0002371817,0.0004508201,0.00003046819,0.0001914412,0.00006427127,0.811505,0.001975236,0.05558485,0.03004943,0.09953],"study_design_scores_gemma":[0.00003021485,0.00005641815,0.00006445171,0.00003769893,0.000006481665,0.00006717787,0.00002559105,0.9772711,0.0007341355,0.01477746,0.00692086,0.000008492123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01029585,0.001049532,0.9484773,0.00118911,0.0003135037,0.0002262982,0.0005420413,0.0006308408,0.03727555],"genre_scores_gemma":[0.4255961,0.00242927,0.5381852,0.0008229922,0.0005364362,0.0007540384,0.001638682,0.0006551172,0.02938203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01816744,"threshold_uncertainty_score":0.06077611,"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."}}