{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007957742,0.0008447136,0.0006882728,0.0004380592,0.0003092306,0.0004601802,0.001035154,0.000854033,0.001910232],"category_scores_gemma":[0.001180974,0.0003977724,0.0006267847,0.0005114487,0.0005470114,0.0008280737,0.0008370911,0.0013884,0.0007045352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000258504,"about_ca_system_score_gemma":0.001059883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001589047,"about_ca_topic_score_gemma":0.001573693,"domain_scores_codex":[0.9996241,0.0001402642,0.00001976118,0.00006645164,0.0001282872,0.00002103603],"domain_scores_gemma":[0.999685,0.0001200622,0.000023652,0.00002397885,0.0001220222,0.00002526761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002399028,0.0001380529,0.0008325591,0.0005926213,0.0001585315,0.0001798623,0.0002147966,0.4203348,0.03646588,0.05980879,0.007296193,0.473738],"study_design_scores_gemma":[0.00001775963,0.00006440573,0.00006254174,0.000005962458,0.000008558063,0.00005219353,0.000006187306,0.9932951,0.001819064,0.002801095,0.001856399,0.00001060493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001179213,0.00006175478,0.9982837,0.00003386375,0.00002003606,0.0000115021,0.000005123072,0.00005583093,0.0003489613],"genre_scores_gemma":[0.06339435,0.0002165506,0.9327603,0.00008704302,0.00006245841,0.0001738529,0.0000767673,0.0001001332,0.003128591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001910232,"threshold_uncertainty_score":0.006390393,"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."}}