{"id":"W4241961027","doi":"10.23952/jano.1.2019.2.05","title":"Polyak’s gradient method for solving the split convex feasibility problem and its applications","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Trường Đại học Giao thông vận tải","keywords":"Regular polygon; Mathematical optimization; Gradient method; Convex optimization; Mathematics; Computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001874185,0.0008208011,0.0009401916,0.0009322379,0.0004331673,0.0007265765,0.001109933,0.001274876,0.00261027],"category_scores_gemma":[0.00349256,0.0004350384,0.0006977345,0.001107129,0.001548345,0.001297606,0.00159847,0.002052059,0.0005468336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005363789,"about_ca_system_score_gemma":0.001427283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002727133,"about_ca_topic_score_gemma":0.001840335,"domain_scores_codex":[0.9994181,0.0002524671,0.00002796255,0.00009670704,0.0001625722,0.00004208082],"domain_scores_gemma":[0.9991673,0.0004630803,0.00005420557,0.00005564375,0.0002060938,0.00005377205],"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.0001939479,0.00009787864,0.0006778249,0.000649241,0.0001017659,0.0001728463,0.0002255528,0.5193589,0.01032935,0.3481896,0.005037977,0.1149651],"study_design_scores_gemma":[0.00001227752,0.0000362895,0.00007527252,0.00001530813,0.000006189939,0.00003652477,0.00001329283,0.9783891,0.0008031336,0.01868406,0.001917498,0.00001095898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003173231,0.0005362015,0.9941555,0.0001573744,0.00005170434,0.00002758564,0.00001643326,0.00004053732,0.001841388],"genre_scores_gemma":[0.2108358,0.001416801,0.7793324,0.0001938934,0.0001134517,0.0004235695,0.0001385269,0.0001835152,0.007362055],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002727133,"threshold_uncertainty_score":0.009911716,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0126004153318758,"score_gpt":0.2634251402608905,"score_spread":0.2508247249290147,"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."}}