{"id":"W4393618622","doi":"10.23952/jnva.8.2024.3.03","title":"Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Science and Technology Planning Project of Shenzhen Municipality; Department of Education of Guangdong Province; Shenzhen University; National Natural Science Foundation of China","keywords":"Subgradient method; Bregman divergence; Regular polygon; Mathematics; Convex optimization; Mathematical optimization; Applied mathematics; 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.003495444,0.001449115,0.001355248,0.0008579207,0.0005401663,0.001206771,0.001343692,0.001774857,0.002110234],"category_scores_gemma":[0.006068329,0.0006659905,0.001034038,0.0007836583,0.001656551,0.003280254,0.001981549,0.003201751,0.0005138573],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001199298,"about_ca_system_score_gemma":0.001613976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002613984,"about_ca_topic_score_gemma":0.00183527,"domain_scores_codex":[0.9987815,0.0006775936,0.000060813,0.0001427793,0.0002678913,0.00006939369],"domain_scores_gemma":[0.998336,0.0009761105,0.0001521019,0.0001200146,0.0003328398,0.00008293435],"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.00008862784,0.00006521846,0.0003788868,0.0003859759,0.000072536,0.0001168021,0.0002605617,0.6311228,0.004529058,0.3250296,0.001782802,0.03616716],"study_design_scores_gemma":[0.000005624998,0.00003030808,0.00003688575,0.00001203725,0.000003275864,0.00001441662,0.00001142107,0.9782637,0.0003464235,0.0203355,0.0009353762,0.000005108249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002531739,0.0002919218,0.9959478,0.0001593135,0.000026113,0.00002597415,0.00001151095,0.00003026437,0.0009754672],"genre_scores_gemma":[0.2511275,0.001618066,0.7384225,0.0003309262,0.0001329395,0.0004895537,0.0001675267,0.000197221,0.007513831],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003495444,"threshold_uncertainty_score":0.0184859,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02586037608595399,"score_gpt":0.3274527099345255,"score_spread":0.3015923338485715,"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."}}