{"id":"W2140440049","doi":"","title":"Adaptive overrelaxed bound optimization methods","year":2003,"lang":"en","type":"article","venue":"","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Speedup; Computer science; Maximization; Convergence (economics); Simple (philosophy); Mathematical optimization; Algorithm; Upper and lower bounds; Scheme (mathematics); Scaling; Factorization; Mathematics; Parallel computing","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.003045373,0.001280651,0.0009656211,0.0007133081,0.0004516302,0.001099146,0.002147486,0.001634887,0.004007468],"category_scores_gemma":[0.01133423,0.0004863975,0.0005520739,0.001024521,0.001470619,0.00231647,0.002064097,0.002421435,0.001573408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006059743,"about_ca_system_score_gemma":0.0007900259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009957554,"about_ca_topic_score_gemma":0.001032382,"domain_scores_codex":[0.9980928,0.0008214233,0.0001034346,0.0003294207,0.0005322864,0.0001205529],"domain_scores_gemma":[0.9967006,0.001884844,0.0003004409,0.0006096826,0.000422233,0.00008206879],"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.0002359653,0.00009031826,0.0004688372,0.0002136004,0.00009121373,0.00009120964,0.0001257315,0.6526198,0.01028484,0.1044455,0.003399251,0.2279337],"study_design_scores_gemma":[0.00002355034,0.00004436977,0.00007896157,0.0000115337,0.000007504764,0.0000330547,0.000006596268,0.9803591,0.002474706,0.01514301,0.001804017,0.00001371433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002257834,0.0001630979,0.9967152,0.0000617164,0.00002233234,0.00001654018,0.000009515071,0.0001342317,0.0006195515],"genre_scores_gemma":[0.1423549,0.0004565764,0.8524764,0.000200631,0.0001132968,0.000236416,0.00008583122,0.0001655546,0.003910329],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004007468,"threshold_uncertainty_score":0.01610565,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03391867002147864,"score_gpt":0.3370380539959439,"score_spread":0.3031193839744653,"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."}}