{"id":"W4200098951","doi":"10.1016/j.ejor.2021.11.054","title":"Parallel subgradient algorithm with block dual decomposition for large-scale optimization","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"National Institute of Dental and Craniofacial Research","keywords":"Subgradient method; Mathematical optimization; Lagrangian relaxation; Block (permutation group theory); Relaxation (psychology); Optimization problem; Algorithm; Decomposition method (queueing theory); Mathematics; Block matrix; Convergence (economics); Matrix (chemical analysis); Computer science; Discrete mathematics","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.001250061,0.001339075,0.001793626,0.0006099595,0.0005368507,0.0009939276,0.001404189,0.001299254,0.004009109],"category_scores_gemma":[0.002733827,0.0007383821,0.0008617624,0.001134855,0.0007732147,0.001282359,0.001979558,0.002445622,0.001235893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006377141,"about_ca_system_score_gemma":0.002339301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005348631,"about_ca_topic_score_gemma":0.006042353,"domain_scores_codex":[0.9993899,0.0002208116,0.0000311551,0.00007454835,0.0002217585,0.00006178443],"domain_scores_gemma":[0.9990242,0.0004953313,0.00006255,0.000140102,0.0002153285,0.00006255871],"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.0004016177,0.0002396089,0.0003866075,0.0002929517,0.0001421248,0.0001457835,0.0001066542,0.7426775,0.008718835,0.04592318,0.01356758,0.1873976],"study_design_scores_gemma":[0.00002243868,0.00001975615,0.00003148714,0.000003190045,0.000004658956,0.00001416537,0.000004741752,0.9945049,0.0004889108,0.004147259,0.000754719,0.000003772855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002880125,0.0001642755,0.995262,0.0001214117,0.00006388267,0.00003486535,0.0000505446,0.0002161603,0.001206614],"genre_scores_gemma":[0.117912,0.0003733215,0.8757258,0.0001735316,0.0001397618,0.0004011837,0.0003991264,0.0002572526,0.004618057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005348631,"threshold_uncertainty_score":0.01341176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03773537911255315,"score_gpt":0.3166255261342679,"score_spread":0.2788901470217148,"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."}}