{"id":"W4380738747","doi":"10.20944/preprints202306.1147.v1","title":"On the Sub Convexlike Optimization Problems","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Vector optimization; Lagrangian; Saddle point; Locally convex topological vector space; Mathematics; Set (abstract data type); Optimization problem; Regular polygon; Point (geometry); Saddle; Mathematical optimization; Pure mathematics; Applied mathematics; Topological space; Topology (electrical circuits); Computer science; Combinatorics; Geometry; Multi-swarm optimization","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018515,0.00115147,0.0006751948,0.0006352785,0.00049831,0.001013951,0.0007632236,0.0008288409,0.003284225],"category_scores_gemma":[0.002353038,0.0003028429,0.0004677046,0.0007171404,0.001756903,0.002225345,0.001683526,0.002166739,0.0004453549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006853796,"about_ca_system_score_gemma":0.0006616205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007877879,"about_ca_topic_score_gemma":0.0004785798,"domain_scores_codex":[0.9995432,0.0001710293,0.00001881628,0.0001009792,0.0001277666,0.00003824989],"domain_scores_gemma":[0.9993317,0.0003169895,0.00008717371,0.00003912087,0.0001299442,0.00009502806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003442203,0.00002764232,0.0002963042,0.0001121154,0.00002118513,0.0001096869,0.00009115404,0.0403682,0.001925877,0.937723,0.00349663,0.01579385],"study_design_scores_gemma":[0.00001325557,0.00009587656,0.0003689016,0.00003728898,0.0000118385,0.0001464851,0.00007245816,0.3088329,0.0008251879,0.681669,0.007910063,0.00001663773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04806621,0.002098433,0.9035212,0.002169549,0.0001763628,0.00006928395,0.0002255704,0.00007558738,0.04359785],"genre_scores_gemma":[0.7791122,0.005379796,0.1716872,0.001487273,0.0008693525,0.0003785716,0.0008648383,0.0002349909,0.03998588],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003284225,"threshold_uncertainty_score":0.0109868,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1518249475627849,"score_gpt":0.3172229888724547,"score_spread":0.1653980413096698,"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."}}