{"id":"W2109154566","doi":"10.1016/j.jat.2006.01.003","title":"A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space","year":2006,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Intersection (aeronautics); Hilbert space; Projection (relational algebra); Regular polygon; Sequence (biology); Space (punctuation); Hilbert manifold; Projection method; Reflection (computer programming); Convex set; Convex analysis; Mathematical analysis; Convex combination; Dykstra's projection algorithm; Pure mathematics; Combinatorics; Convex optimization; Geometry; Mathematical optimization; Algorithm","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.003248635,0.001504488,0.002053066,0.0009933766,0.0005052275,0.001616337,0.002959568,0.001861611,0.003758973],"category_scores_gemma":[0.004984644,0.001142361,0.0020107,0.0006911232,0.002251395,0.00285792,0.004180757,0.004417005,0.001169973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006453226,"about_ca_system_score_gemma":0.001887138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009268792,"about_ca_topic_score_gemma":0.0008813252,"domain_scores_codex":[0.9989995,0.0004029338,0.00004682631,0.0001673328,0.0003042947,0.00007918457],"domain_scores_gemma":[0.9981584,0.001097498,0.0001098625,0.0001751972,0.0003002634,0.0001588981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009710882,0.0004448348,0.001307123,0.0008279876,0.000356624,0.0004365465,0.000656115,0.2933781,0.06944199,0.3637096,0.005079542,0.2633904],"study_design_scores_gemma":[0.00004211971,0.0001487211,0.00006667869,0.0000173827,0.00001933552,0.00007655007,0.00003780807,0.9778886,0.003117015,0.01775036,0.000813805,0.00002168985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003500622,0.00003141671,0.9958689,0.00004848314,0.0000171626,0.00002693515,0.00000956879,0.00007865943,0.0004182257],"genre_scores_gemma":[0.07708817,0.0001393108,0.9186568,0.00008619049,0.00004666834,0.0002485838,0.000120013,0.0002412176,0.003372987],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003758973,"threshold_uncertainty_score":0.01718062,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02054058143690368,"score_gpt":0.3152627328316414,"score_spread":0.2947221513947377,"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."}}