{"id":"W1901524206","doi":"10.1007/s10898-015-0373-5","title":"On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces","year":2015,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Convergence (economics); Euclidean geometry; Context (archaeology); Projection (relational algebra); Constraint (computer-aided design); Regular polygon; Mathematical optimization; Applied mathematics; Euclidean space; Algorithm; Convex optimization; Mathematical analysis; 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.0007663554,0.00009283222,0.0002065712,0.00007914358,0.0000575464,0.0000906401,0.0002649391,0.00005650573,0.00000704843],"category_scores_gemma":[0.0003879797,0.00006729158,0.00007848578,0.0005210682,0.00004325295,0.0006436966,0.00005826841,0.00007185358,4.609148e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001401807,"about_ca_system_score_gemma":0.0001540087,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002217953,"about_ca_topic_score_gemma":0.00001465393,"domain_scores_codex":[0.9988141,0.00009367245,0.0005087167,0.0001453318,0.000333051,0.0001051143],"domain_scores_gemma":[0.9982491,0.0001239096,0.0006983544,0.00013699,0.0007187323,0.00007298867],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002077389,0.00007551655,0.01497157,0.00001046643,0.00001989423,4.463722e-7,0.0002154509,0.9762071,0.000004765933,0.007504723,0.0001552982,0.0008139932],"study_design_scores_gemma":[0.001091187,0.0001876894,0.004656393,0.00005815316,0.00002104582,0.00000910553,0.00004963264,0.9867103,0.00004317478,0.007054619,0.00004725551,0.00007143908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008978668,0.00006537278,0.9890353,0.001197424,0.0004068623,0.0002119276,0.00001630174,0.000006966612,0.00008117582],"genre_scores_gemma":[0.7877489,0.0000423719,0.2119285,0.0002021982,0.00003969338,0.000002906475,0.000006551817,0.000003794567,0.0000251844],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7787701,"threshold_uncertainty_score":0.2744071,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02642004899376784,"score_gpt":0.2788745590008693,"score_spread":0.2524545100071015,"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."}}