{"id":"W4241420265","doi":"10.23952/jnva.4.2020.3.10","title":"A descent SQP alternating direction method for minimizing the sum of three convex functions","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Descent (aeronautics); Sequential quadratic programming; Descent direction; Mathematical optimization; Regular polygon; Mathematics; Convex function; Gradient descent; Computer science; Control theory (sociology); Quadratic programming; Geometry; Engineering; Artificial intelligence; Aerospace engineering","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.00100811,0.00006305232,0.0002183051,0.0001702125,0.0001109806,0.00007464306,0.0002049629,0.00003002991,0.000008490541],"category_scores_gemma":[0.0002413896,0.00004335323,0.0002383678,0.0006279374,0.00001336879,0.0002388753,0.00004333389,0.0001094348,2.637813e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001502161,"about_ca_system_score_gemma":0.0000733043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002520585,"about_ca_topic_score_gemma":0.00001797394,"domain_scores_codex":[0.9990298,0.00009974181,0.0004327363,0.0001108419,0.0002638449,0.00006307524],"domain_scores_gemma":[0.9983593,0.000474868,0.0005453438,0.00008274525,0.0004865278,0.00005125178],"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.0008553388,0.001470714,0.08709389,0.0002693676,0.0238583,0.0000124696,0.02556505,0.3540173,0.04071071,0.2514032,0.00407616,0.2106674],"study_design_scores_gemma":[0.0002238684,0.0001084663,0.008485832,0.000006352276,0.0004091667,0.000006888211,0.00005956439,0.9872627,0.0008493747,0.001323147,0.001216294,0.00004830596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004996913,0.00007319126,0.9852632,0.009487941,0.00005313475,0.00006585101,0.000009516815,0.00001232222,0.00003789124],"genre_scores_gemma":[0.2867095,0.00001898603,0.7124228,0.0005913546,0.0002311521,0.000003124956,0.000004783687,0.000003545819,0.00001473486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6332455,"threshold_uncertainty_score":0.1767894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04348730988575707,"score_gpt":0.3143158044043354,"score_spread":0.2708284945185784,"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."}}