{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006786789,0.00007466999,0.00007892606,0.00007518955,0.00006817797,0.0001402364,0.000245117,0.0000544917,0.0001087022],"category_scores_gemma":[0.00009017024,0.00006756948,0.00003271027,0.0003274716,0.00001926068,0.0005524809,0.00004543383,0.00007444641,0.00002191789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002828679,"about_ca_system_score_gemma":0.00006160333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008381277,"about_ca_topic_score_gemma":0.00000177008,"domain_scores_codex":[0.9990837,0.0003381153,0.0001307929,0.0002098934,0.0001212384,0.0001162619],"domain_scores_gemma":[0.9994209,0.00009427869,0.00005024708,0.0003154986,0.00007456561,0.00004453786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[7.197556e-7,0.00001938971,0.00000751378,4.033869e-7,0.000004467344,4.752689e-7,0.0002498641,0.006690817,0.0001155212,0.9869852,0.0009719312,0.004953691],"study_design_scores_gemma":[0.0002113402,0.0001048339,0.0000577095,0.000003949956,0.00000335376,0.00001214686,0.00005344781,0.8673234,0.05041347,0.06262023,0.01896608,0.0002300171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002878364,0.00002888302,0.8561285,0.000201076,0.00008690306,0.00009737629,9.620263e-8,0.0004200308,0.1430084],"genre_scores_gemma":[0.02868447,0.000006843934,0.9688666,0.0009008336,0.000005657121,0.00001235436,5.824407e-7,0.000005308481,0.001517338],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.924365,"threshold_uncertainty_score":0.2755404,"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."}}