{"id":"W2082889410","doi":"10.1023/b:jota.0000025708.31430.22","title":"Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Orthant; Projection (relational algebra); Intersection (aeronautics); Cone (formal languages); Convex cone; Regular polygon; Conic optimization; Convex set; Reflection (computer programming); Convex optimization; Euclidean space; Dual cone and polar cone; Theory of computation; Set (abstract data type); Combinatorics; 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.002790397,0.001542236,0.00199084,0.0008830708,0.0005661155,0.001515076,0.002351433,0.001655763,0.005854008],"category_scores_gemma":[0.005472131,0.001106684,0.001753568,0.0008187449,0.001861709,0.002176171,0.00351608,0.004801435,0.0008279569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006624013,"about_ca_system_score_gemma":0.002072324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002056048,"about_ca_topic_score_gemma":0.002181798,"domain_scores_codex":[0.9993089,0.0003289993,0.00003102624,0.00009171589,0.000186998,0.00005230121],"domain_scores_gemma":[0.998172,0.001245492,0.00008498482,0.0001084363,0.0002557948,0.0001332467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003704537,0.0003044771,0.0006461813,0.0008442571,0.0001557543,0.0003209127,0.0003357832,0.401504,0.01126293,0.4711818,0.006214387,0.1068591],"study_design_scores_gemma":[0.00002846283,0.00006238989,0.00003935163,0.00002441185,0.0000154001,0.00004509544,0.00002836127,0.9575776,0.000729423,0.04010078,0.001335389,0.00001320412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002530431,0.00009138233,0.995685,0.00008432765,0.00003156641,0.00003306831,0.00002016185,0.00003948579,0.001484597],"genre_scores_gemma":[0.1037533,0.0004865557,0.8869361,0.0001331418,0.0001024542,0.0003924306,0.000182806,0.0003213806,0.007691807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005854008,"threshold_uncertainty_score":0.01958364,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02683320622498632,"score_gpt":0.3268623808754776,"score_spread":0.3000291746504913,"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."}}