{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001978019,0.001808036,0.001410829,0.001055458,0.0006170648,0.0009535999,0.001933128,0.001565424,0.003121606],"category_scores_gemma":[0.004718732,0.0006963611,0.001411547,0.00118143,0.001473666,0.001439332,0.002603278,0.001955572,0.00073932],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049184,"about_ca_system_score_gemma":0.001481626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003479513,"about_ca_topic_score_gemma":0.003236103,"domain_scores_codex":[0.9990953,0.0003281563,0.000039591,0.0001290422,0.0003410067,0.00006696818],"domain_scores_gemma":[0.9988601,0.0006525888,0.0001130134,0.00009770063,0.0002285558,0.00004807377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000513844,0.00005083897,0.0003298686,0.0001748147,0.0001032028,0.0001274166,0.0001195675,0.8273461,0.002515958,0.1146485,0.001171718,0.0533606],"study_design_scores_gemma":[0.000008837924,0.00002346598,0.00003157994,0.000008477323,0.000006933574,0.00002274477,0.000007084568,0.977519,0.0005235132,0.02064919,0.001192562,0.000006501611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002629565,0.0001802587,0.9948382,0.00008467319,0.00002816278,0.00003450128,0.0000163539,0.00005748288,0.00213077],"genre_scores_gemma":[0.2103196,0.000990137,0.7772939,0.0001467143,0.0001814034,0.0008350042,0.0001729657,0.0002978535,0.009762455],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003479513,"threshold_uncertainty_score":0.01046091,"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."}}