{"id":"W2079646161","doi":"10.1007/s10898-007-9270-x","title":"An inexact proximal point method for solving generalized fractional programs","year":2008,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Mathematical optimization; Regularization (linguistics); Rate of convergence; Parametric statistics; Convergence (economics); Applied mathematics; Regular polygon; Term (time); Computer science; Key (lock)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006055246,0.0001323732,0.0002488598,0.0001192731,0.0002378256,0.0001728951,0.0004065667,0.00007815122,0.00004231677],"category_scores_gemma":[0.0001482158,0.0001135684,0.0002064909,0.0006772949,0.00001825283,0.001956514,0.00003240617,0.00008497088,0.000001570495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001911987,"about_ca_system_score_gemma":0.0003092823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001399967,"about_ca_topic_score_gemma":0.000002523741,"domain_scores_codex":[0.9984364,0.0001052076,0.0005890392,0.0002069566,0.0004853052,0.0001771205],"domain_scores_gemma":[0.9976349,0.00005124633,0.0006855362,0.0001662619,0.001308293,0.0001537888],"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.00006221611,0.0002501747,0.001315669,0.000003746211,0.00007232754,0.00000497626,0.0000748912,0.974984,0.00004575258,0.0200803,0.0004413887,0.002664547],"study_design_scores_gemma":[0.0009548783,0.0002940065,0.001049513,0.000009058302,0.00003887266,0.0002951099,0.00001237509,0.9953681,0.0000426465,0.00139295,0.0004130158,0.0001294634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006374249,0.00004527589,0.9968643,0.001806628,0.0002733381,0.0001783846,0.000004844409,0.00004531889,0.0001444736],"genre_scores_gemma":[0.06506451,0.00003479667,0.9341482,0.0004072505,0.0002654012,0.000008079323,0.0000318748,0.000007459546,0.00003245065],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06442709,"threshold_uncertainty_score":0.4631185,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02341616659943074,"score_gpt":0.3095328237218821,"score_spread":0.2861166571224514,"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."}}