{"id":"W2131096322","doi":"10.48550/arxiv.1305.4296","title":"The Method of Alternating Relaxed Projections for two nonconvex sets","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Constraint (computer-aided design); Projection (relational algebra); Set (abstract data type); Mathematical optimization; Mathematics; Order (exchange); Local convergence; Projection method; Computer science; Algorithm; Dykstra's projection algorithm; Iterative method; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.003530382,0.001499254,0.001193446,0.0008279024,0.0007995345,0.001382622,0.001583956,0.0016299,0.003795494],"category_scores_gemma":[0.006582316,0.0009105986,0.001475681,0.0007006737,0.002369804,0.002118038,0.003903952,0.003503537,0.0007981464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000656503,"about_ca_system_score_gemma":0.001454753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001071164,"about_ca_topic_score_gemma":0.001102819,"domain_scores_codex":[0.9977723,0.001471088,0.0000610286,0.0002077454,0.0003848356,0.0001030958],"domain_scores_gemma":[0.9976922,0.001568006,0.0001646025,0.0002135182,0.0002290779,0.000132636],"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.0002060584,0.00007488958,0.0005218619,0.0004537739,0.0001475864,0.0003396234,0.0003954747,0.4716066,0.006583097,0.4262618,0.003743824,0.08966528],"study_design_scores_gemma":[0.00002878094,0.00008484325,0.00005637126,0.00003102373,0.00001195838,0.00009189933,0.00002923917,0.9283971,0.001262015,0.06649967,0.00348444,0.00002269162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002762237,0.0001210104,0.9954596,0.0001369396,0.00002676888,0.00003750744,0.0000142921,0.00005083,0.001390857],"genre_scores_gemma":[0.1010216,0.0003213181,0.8929698,0.000135708,0.0000870377,0.0004729092,0.0001033509,0.0001612047,0.004726976],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003795494,"threshold_uncertainty_score":0.01867068,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08478204715207371,"score_gpt":0.2505383421827856,"score_spread":0.1657562950307119,"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."}}