{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006016988,0.00009459354,0.0002118737,0.0000777895,0.0001656795,0.0001377552,0.0002042886,0.00004472849,0.000016291],"category_scores_gemma":[0.00002873155,0.00006305948,0.0000634852,0.0003010605,0.00001580833,0.0002517888,0.00006321646,0.00009506033,0.000001624516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002844232,"about_ca_system_score_gemma":0.00004568402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001445065,"about_ca_topic_score_gemma":1.04266e-7,"domain_scores_codex":[0.9990921,0.00003079038,0.0003674413,0.0002045547,0.0001906373,0.0001145022],"domain_scores_gemma":[0.9988597,0.0002927857,0.000366643,0.0001299668,0.0002601059,0.0000907965],"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.00005650711,0.00009563289,0.0001709002,0.0000373537,0.00006736328,1.121925e-7,0.0004113436,0.5140567,0.0004051746,0.4748729,0.00006753921,0.009758458],"study_design_scores_gemma":[0.0004763886,0.00006992956,0.0003312073,0.000005395498,0.00004089159,0.0000107103,0.00004284313,0.9894356,0.00009296561,0.008463542,0.0009468114,0.00008370138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002813898,0.000127354,0.9957423,0.002834479,0.00004122129,0.0005025269,0.000002239404,0.00001334266,0.0004551788],"genre_scores_gemma":[0.2364556,0.00009890463,0.7627668,0.0005185126,0.00006031286,0.00002919174,0.000004471256,0.000006839782,0.00005928708],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4753789,"threshold_uncertainty_score":0.2571491,"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."}}