{"id":"W4231873779","doi":"10.23952/jnva.2.2018.2.07","title":"A Krasnoselskii-type algorithm for approximating solutions of variational inequality problems and convex feasibility problems","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"African Capacity Building Foundation; Anhui University of Science and Technology","keywords":"Variational inequality; Mathematics; Regular polygon; Type (biology); Inequality; Applied mathematics; Mathematical optimization; Mathematical analysis; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002510563,0.0001581742,0.000547934,0.0005458396,0.0003046378,0.0001289817,0.0002661103,0.00009379708,0.0000539941],"category_scores_gemma":[0.0005321996,0.0001321559,0.0002609142,0.001709709,0.0001035844,0.0006268212,0.0001154153,0.0001217862,9.115719e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004878201,"about_ca_system_score_gemma":0.0002613972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005291679,"about_ca_topic_score_gemma":0.00002547656,"domain_scores_codex":[0.9976158,0.0001687373,0.001158903,0.0003123892,0.0005599875,0.0001842168],"domain_scores_gemma":[0.9948292,0.00050252,0.001210915,0.0001924933,0.003126911,0.0001379034],"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.0002955383,0.004771226,0.1245394,0.000615371,0.02292625,0.000003455752,0.01086629,0.161062,0.002784935,0.6329179,0.0004679743,0.03874965],"study_design_scores_gemma":[0.0007608548,0.0002313094,0.03191053,0.00001566127,0.0007222354,0.0000119038,0.00002628338,0.9497607,0.00002276969,0.01623322,0.0001693146,0.000135234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004023255,0.0001198273,0.9939958,0.001435532,0.00009577157,0.0001767123,0.0001006989,0.00001281005,0.00003956277],"genre_scores_gemma":[0.2749768,0.00003957083,0.7244204,0.0001308781,0.0002969991,0.000005558342,0.00007502146,0.000006268891,0.00004845398],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7886987,"threshold_uncertainty_score":0.5389163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05466155751586396,"score_gpt":0.3008211946683584,"score_spread":0.2461596371524944,"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."}}