{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002188685,0.001360116,0.001108114,0.0005884842,0.000491641,0.001363061,0.00116001,0.001017487,0.001993671],"category_scores_gemma":[0.01065247,0.0005099273,0.0009825455,0.0008446404,0.001637013,0.001153882,0.001698555,0.002813625,0.000625243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001067098,"about_ca_system_score_gemma":0.001667575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006503354,"about_ca_topic_score_gemma":0.004631465,"domain_scores_codex":[0.9990606,0.0003045711,0.00004531974,0.0001054783,0.0003875873,0.00009642108],"domain_scores_gemma":[0.9962248,0.002767527,0.0002509946,0.0003719222,0.0003117645,0.00007311181],"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.00008060253,0.00003313001,0.0003656191,0.0001137711,0.00002143288,0.00005719152,0.00007186188,0.9556867,0.001827991,0.01808989,0.000524876,0.02312699],"study_design_scores_gemma":[0.000004836495,0.00001248458,0.00002969122,0.000009218951,0.000001992257,0.000006389339,0.000005819184,0.9959984,0.000359179,0.003185801,0.0003844134,0.000001829622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01673126,0.0003489155,0.9781206,0.0002259513,0.00004556411,0.00005126869,0.00004172088,0.0004001068,0.004034582],"genre_scores_gemma":[0.3293469,0.0007056012,0.6648787,0.0001971573,0.00007485162,0.0002959108,0.0001933237,0.0002659008,0.004041635],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006503354,"threshold_uncertainty_score":0.01293099,"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."}}