{"id":"W2963283644","doi":"10.1007/s10013-013-0049-8","title":"The Method of Alternating Relaxed Projections for Two Nonconvex Sets","year":2013,"lang":"en","type":"article","venue":"Vietnam Journal of Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Convergence (economics); Projection (relational algebra); Constraint (computer-aided design); Set (abstract data type); Mathematical optimization; Order (exchange); Projection method; Algorithm; Dykstra's projection algorithm; Computer science; 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.001252421,0.0000690646,0.0001909956,0.0001035764,0.0001695596,0.0001173052,0.0005123454,0.00002229839,0.00001809002],"category_scores_gemma":[0.0004805995,0.00004147193,0.0001733054,0.000293003,0.00001681195,0.0003229486,0.00005342942,0.00008671809,0.000005791307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002198553,"about_ca_system_score_gemma":0.00008047524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005191901,"about_ca_topic_score_gemma":0.000002224121,"domain_scores_codex":[0.9988265,0.00006588639,0.0006435791,0.0000672412,0.0002951233,0.0001016537],"domain_scores_gemma":[0.9971169,0.0007837949,0.0009608551,0.0001946502,0.0008986806,0.00004513037],"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.0000122988,0.0009402097,0.0004502631,0.0002967094,0.00125047,0.000002643951,0.01100811,0.07416841,0.006039684,0.8165736,0.008638393,0.08061919],"study_design_scores_gemma":[0.0003402358,0.00006777254,0.00004955514,0.00003914496,0.00004288042,0.00005534227,0.000334299,0.9563183,0.0007621214,0.04153386,0.0004020879,0.00005439056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001200715,0.00003939762,0.9954248,0.002607239,0.000173933,0.0001681964,0.000001189096,0.000008412988,0.0003761163],"genre_scores_gemma":[0.02242212,0.00002434139,0.9771296,0.00006610159,0.00005836102,0.00001139932,3.005487e-7,0.0000061988,0.000281561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8821499,"threshold_uncertainty_score":0.1691176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02677401167477635,"score_gpt":0.3279347272557826,"score_spread":0.3011607155810063,"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."}}