{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243869,0.000100567,0.0001731711,0.0001887214,0.0003166461,0.0001450383,0.0002000378,0.00005461855,0.00001437651],"category_scores_gemma":[0.0000619592,0.00007912706,0.00005725394,0.0005692032,0.00004080426,0.0009404139,0.00001693874,0.00008856432,6.98491e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006175531,"about_ca_system_score_gemma":0.0001509804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003543079,"about_ca_topic_score_gemma":0.000003890134,"domain_scores_codex":[0.9989966,0.0001495952,0.0003755343,0.0002213981,0.0001626304,0.00009424558],"domain_scores_gemma":[0.9982296,0.0001699436,0.0004651271,0.0002117104,0.0008197873,0.0001038657],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006711007,0.000150095,0.00002191587,0.000008489362,0.00003579494,9.846158e-8,0.0001579986,0.6170569,0.0000962688,0.3803857,0.00000426952,0.002015417],"study_design_scores_gemma":[0.003083918,0.0009192694,0.0002401988,0.00003066906,0.0001916239,0.0001898699,0.0002520561,0.7193059,0.001236552,0.2724516,0.001805943,0.000292377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001881648,0.00003910818,0.9980183,0.001070771,0.0000345192,0.0004551148,0.00000450742,0.00004103254,0.0001484445],"genre_scores_gemma":[0.03540239,0.00006283633,0.9639404,0.0002867928,0.00009641999,0.00008788935,0.00001902476,0.000009411841,0.0000948087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.107934,"threshold_uncertainty_score":0.3226708,"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."}}