{"id":"W4250090602","doi":"10.23952/jnva.3.2019.2.01","title":"Iterative methods for parallel convex optimization with fixed point constraints","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Fixed point; Regular polygon; Mathematical optimization; Conic optimization; Convex optimization; Mathematics; Iterative method; Point (geometry); Computer science; Convex combination; 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.0008177247,0.0001359126,0.0004528099,0.0005359692,0.0001024161,0.0001870194,0.000225953,0.00005935115,0.0003119318],"category_scores_gemma":[0.0001165563,0.00009773188,0.0002653265,0.001075875,0.00003398026,0.0006794849,0.00003521535,0.00009700156,0.000002647034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003414552,"about_ca_system_score_gemma":0.000173413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004652788,"about_ca_topic_score_gemma":0.000002152359,"domain_scores_codex":[0.9986317,0.00015766,0.0005490058,0.0002326762,0.0003063404,0.0001226557],"domain_scores_gemma":[0.9972178,0.0005486828,0.0006523316,0.0001457336,0.001327998,0.0001073988],"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.0000868193,0.0001091837,0.004017007,0.000009241477,0.002606667,0.000001034744,0.0003286963,0.9553529,0.00005811852,0.03589631,0.00003620704,0.001497786],"study_design_scores_gemma":[0.001134615,0.0001770333,0.00373398,0.000008550321,0.0007025374,0.00002012869,0.00005512018,0.9927642,0.00002405513,0.000945299,0.0003010694,0.0001334261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000398452,0.00004917233,0.9970432,0.002112691,0.00006992245,0.0001264882,0.00001917694,0.000009953389,0.0001709535],"genre_scores_gemma":[0.0316337,0.00003019017,0.9674711,0.0004675256,0.00008500255,0.000004177195,0.00006712349,0.000005841723,0.0002353214],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03741126,"threshold_uncertainty_score":0.398539,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01241103611989667,"score_gpt":0.3003263482368869,"score_spread":0.2879153121169902,"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."}}