{"id":"W2067877923","doi":"10.1007/s11075-005-9010-6","title":"Extrapolation algorithm for affine-convex feasibility problems","year":2005,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Subgradient method; Linear subspace; Theory of computation; Hilbert space; Affine transformation; Countable set; Algorithm; Mathematical optimization; Regular polygon; Convex optimization; Applied mathematics; Discrete mathematics; Pure mathematics; Geometry","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.0003174885,0.0001634927,0.000227625,0.0001047564,0.0001820017,0.0001531002,0.0004521826,0.00008541828,0.0001668783],"category_scores_gemma":[0.00005595167,0.0001457366,0.0001742179,0.0006975335,0.00002567539,0.0006677893,0.00007327901,0.0001003033,0.00009771653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001072429,"about_ca_system_score_gemma":0.00006990253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002274414,"about_ca_topic_score_gemma":0.000002451447,"domain_scores_codex":[0.9984192,0.00005354091,0.0003725928,0.0005173286,0.0003478461,0.0002894968],"domain_scores_gemma":[0.998977,0.0001264803,0.0001265766,0.0003504736,0.0002683872,0.0001510919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003069532,0.0003055662,0.0001904032,0.000006026361,0.00003743724,3.833292e-7,0.0001719442,0.01291383,0.00005466429,0.01190152,0.0007607951,0.9736543],"study_design_scores_gemma":[0.000506713,0.00006394319,0.001241112,0.000002726933,0.00001341652,0.0000036285,0.000004024951,0.9727883,0.0001407767,0.002937808,0.02210284,0.0001946999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000324987,0.00006159984,0.9932193,0.005350889,0.0001717449,0.0003540905,0.0000159245,0.0002311142,0.0005628567],"genre_scores_gemma":[0.02495264,0.00000930301,0.9725329,0.0007924158,0.0004192393,0.00008165993,0.00005362986,0.00001226383,0.001145974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9734597,"threshold_uncertainty_score":0.5942968,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02880830279725132,"score_gpt":0.2799854235218669,"score_spread":0.2511771207246156,"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."}}