{"id":"W3104930806","doi":"","title":"On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces","year":2017,"lang":"en","type":"article","venue":"Figshare","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Convergence (economics); Euclidean geometry; Regular polygon; Algorithm; Task (project management); Mathematical optimization","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003055398,0.0001032838,0.000146194,0.00003832324,0.0004297876,0.0002964177,0.001583957,0.00004865251,0.002673355],"category_scores_gemma":[0.002468429,0.00006154089,0.0001155711,0.0001893243,0.00002366046,0.0003619105,0.000351329,0.0001109794,0.0000431882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002581569,"about_ca_system_score_gemma":0.00009605418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000590231,"about_ca_topic_score_gemma":0.00008842737,"domain_scores_codex":[0.9990286,0.00005797868,0.0002325336,0.0002692007,0.0002560373,0.0001556331],"domain_scores_gemma":[0.9977682,0.0007219245,0.0003985114,0.0008413322,0.0002393004,0.00003068902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001113359,0.001727985,0.05860011,0.001562339,0.0006311184,0.0000101532,0.01453821,0.2947292,0.0003255805,0.2589279,0.2990853,0.06975067],"study_design_scores_gemma":[0.0002656508,0.00002604856,0.02826002,0.0002773628,0.000004860451,2.697714e-7,0.00001888032,0.9651509,0.0004477057,0.003321149,0.002122949,0.0001041924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01369069,0.0005006157,0.6214973,0.1122182,0.004570951,0.01396282,0.2186164,0.0005831059,0.0143599],"genre_scores_gemma":[0.9932877,0.000003558029,0.00433807,0.0008503888,0.00005735519,0.0001638944,0.0007009177,0.000008616087,0.0005895137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.979597,"threshold_uncertainty_score":0.9982383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08094162861436088,"score_gpt":0.290745497745842,"score_spread":0.2098038691314811,"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."}}