{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004580515,0.0001397281,0.0001974565,0.0001685957,0.0003035196,0.0001182033,0.001107537,0.00008958439,0.00001634971],"category_scores_gemma":[0.0001044439,0.0001209661,0.0002401018,0.0005171379,0.00003919188,0.0002293909,0.0006801808,0.0001922786,0.0000122645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008281576,"about_ca_system_score_gemma":0.0001758811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004184973,"about_ca_topic_score_gemma":0.00005891576,"domain_scores_codex":[0.9988784,0.0001583633,0.0002262619,0.0004943389,0.00008253271,0.0001600723],"domain_scores_gemma":[0.9978397,0.0005168073,0.0004441167,0.0006190595,0.0005238121,0.00005647747],"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.000003878307,0.00002394061,0.0002213001,0.00001432246,0.0001287065,8.951972e-7,0.0001067527,0.4961835,0.00001516991,0.5025021,0.0001610754,0.0006383089],"study_design_scores_gemma":[0.0002662824,0.00001561286,0.0001536213,0.00001583241,0.00006858303,9.128941e-7,0.00004368831,0.9344161,0.0001082066,0.06441883,0.0003669639,0.000125393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002758638,0.000009193502,0.9946308,0.0004500373,0.0003510096,0.0003650964,0.00001346383,0.00006660255,0.001355184],"genre_scores_gemma":[0.7771219,0.00005213747,0.2178293,0.00007646945,0.00006529744,0.000009003651,0.00002025242,0.00001199494,0.004813666],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7768015,"threshold_uncertainty_score":0.4932857,"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."}}