{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002992108,0.001430867,0.00160056,0.0009003274,0.0007321366,0.001611765,0.002142191,0.002212535,0.005006744],"category_scores_gemma":[0.005168858,0.001365186,0.001912491,0.0007216838,0.002119505,0.002206157,0.004366808,0.004308653,0.0007889911],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007524015,"about_ca_system_score_gemma":0.00180701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001859775,"about_ca_topic_score_gemma":0.001678654,"domain_scores_codex":[0.9985502,0.0009175086,0.00004382566,0.000162162,0.0002465298,0.00007972972],"domain_scores_gemma":[0.9979361,0.001416084,0.000102352,0.0001392909,0.0002358633,0.0001702616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003343125,0.0001496539,0.0005402035,0.0008436553,0.0002056083,0.0002627973,0.0004611173,0.4724823,0.006136901,0.4222063,0.005831568,0.09054562],"study_design_scores_gemma":[0.00002514164,0.00008936733,0.00006441222,0.00003349833,0.00001781222,0.00007593517,0.00003566199,0.9488921,0.0005956103,0.0476408,0.002506315,0.00002337176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003718698,0.000146841,0.9938712,0.0001684267,0.00006456291,0.00004077291,0.00002729027,0.00004230148,0.001919986],"genre_scores_gemma":[0.1208818,0.0004419562,0.8681399,0.0002025984,0.0001659671,0.000484458,0.0002103915,0.0002383823,0.009234512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005006744,"threshold_uncertainty_score":0.0167492,"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."}}