{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009327449,0.00007926243,0.0001108944,0.0001290897,0.0001706081,0.0001378607,0.0000988306,0.00001743529,0.00003954176],"category_scores_gemma":[0.0000465737,0.00006764323,0.00004921776,0.0001686505,0.00002421328,0.000162549,0.00002915571,0.0002422665,0.000005872818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005753458,"about_ca_system_score_gemma":0.00008787161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.525007e-7,"about_ca_topic_score_gemma":0.000001971983,"domain_scores_codex":[0.9987673,0.0002407928,0.0002482261,0.0001037765,0.0004413415,0.0001985446],"domain_scores_gemma":[0.9982855,0.00008786061,0.00003404705,0.0001030099,0.001403015,0.00008656021],"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.00008056842,0.0001076931,0.00002985945,0.000009724907,0.00007667156,0.0003706084,0.0002876271,0.9762212,0.007538576,0.0005412106,0.01219279,0.002543492],"study_design_scores_gemma":[0.001504448,0.0006817881,0.0008358771,0.0001984658,0.00001974581,0.0008937216,0.0002028033,0.9455961,0.02946418,0.0001190091,0.02029188,0.0001919911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0258599,0.0004221159,0.9707969,0.0004436359,0.0001070759,0.0001297966,0.00001499434,0.00003753285,0.002188004],"genre_scores_gemma":[0.4665468,0.000160971,0.5325491,0.00004964829,0.0004322717,0.00000407287,0.00004872878,0.00004007452,0.0001683122],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4406869,"threshold_uncertainty_score":0.2758411,"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."}}