{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003513135,0.00009044157,0.0001752094,0.0002423403,0.0001361386,0.00007792957,0.000262887,0.00004294004,0.0000146988],"category_scores_gemma":[0.0001659256,0.0000546021,0.0001583799,0.0006129574,0.00002702382,0.0004958067,0.00002667284,0.0001461358,7.975412e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002135831,"about_ca_system_score_gemma":0.0001103407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001085116,"about_ca_topic_score_gemma":0.000116679,"domain_scores_codex":[0.9983453,0.0005389663,0.000593157,0.0001249345,0.0002936703,0.0001040267],"domain_scores_gemma":[0.9979571,0.0004813553,0.0009736548,0.0001522924,0.0004178082,0.00001777759],"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":[0.0002591714,0.0001693584,0.0003495213,0.00002656944,0.0001009066,3.13592e-7,0.003263117,0.1048498,0.003687923,0.8798327,0.0004639832,0.006996609],"study_design_scores_gemma":[0.0009860926,0.0001276249,0.001946477,0.00003200016,0.0000519829,0.0000281874,0.000698498,0.8840356,0.004885803,0.106854,0.0002840632,0.00006960211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01495931,0.00002877557,0.9811473,0.002701779,0.0003386105,0.0003360531,0.00000126063,0.00001111676,0.0004758297],"genre_scores_gemma":[0.8787819,0.000004650257,0.1207397,0.0001077883,0.0001231227,0.00002521591,0.000004335013,0.000006561699,0.0002067079],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8638226,"threshold_uncertainty_score":0.2226609,"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."}}