{"id":"W3199848312","doi":"","title":"On the approximation of separable non-convex optimization programs to an arbitrary numerical precision","year":2021,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fondation Mathématique Jacques Hadamard","keywords":"Solver; Mathematical optimization; Mathematics; Convergence (economics); Computer science; Applied mathematics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002279827,0.0002839117,0.0003722129,0.000138718,0.0001469174,0.000390264,0.0006672603,0.0002418663,0.0001897497],"category_scores_gemma":[0.0008682139,0.0002519184,0.0001454604,0.0005356143,0.00007074895,0.0001699315,0.0003520602,0.0004757239,0.00001504307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007643113,"about_ca_system_score_gemma":0.00008278702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000497151,"about_ca_topic_score_gemma":0.00002508852,"domain_scores_codex":[0.9970711,0.00120723,0.0005737136,0.0004575804,0.0004339386,0.0002563668],"domain_scores_gemma":[0.9965102,0.0007044015,0.0002085988,0.001416645,0.0009870501,0.0001731127],"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.00001887523,0.001317051,0.00004411313,0.0007093502,0.0001090105,0.000001944966,0.01183882,0.8515165,0.0007254513,0.06224727,0.000406893,0.07106477],"study_design_scores_gemma":[0.0001523192,0.000001425997,0.00003009776,0.00137227,0.00002624147,0.000001737801,0.0001630685,0.9794704,0.0160436,0.002233441,0.0002512263,0.0002541869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02812013,0.00009478962,0.9461095,0.001048408,0.0001434367,0.001014215,0.000008199551,0.0003137019,0.02314759],"genre_scores_gemma":[0.5330282,0.00007732628,0.4656553,0.00006916552,0.00001273802,0.0002120169,0.0005398706,0.00006432855,0.0003409672],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5049081,"threshold_uncertainty_score":0.9999933,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01416994267230026,"score_gpt":0.2258102426584394,"score_spread":0.2116402999861391,"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."}}