{"id":"W61549919","doi":"10.1023/a:1011220302800","title":"On the Superlinear Convergence Order of the Logarithmic Barrier Algorithm","year":2001,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mathematics; Extrapolation; Convergence (economics); Rate of convergence; Context (archaeology); Asymptotically optimal algorithm; Applied mathematics; Mathematical optimization; Nonlinear system; Penalty method; Newton's method; Interior point method; Algorithm; Mathematical analysis; 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.0001961018,0.0001208063,0.0001206254,0.00006800245,0.0004230406,0.00003462896,0.0002660573,0.00005321073,0.0005737224],"category_scores_gemma":[0.0003096792,0.00007847996,0.0000450864,0.0008130074,0.0002747745,0.00008495797,0.00008394657,0.0001537165,0.0000142226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002886604,"about_ca_system_score_gemma":0.00009458441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002306905,"about_ca_topic_score_gemma":0.000001027936,"domain_scores_codex":[0.9988708,0.00008965799,0.0003076721,0.0002188297,0.0003772785,0.000135792],"domain_scores_gemma":[0.998102,0.0007885687,0.0001413343,0.0003037801,0.0006043305,0.00005999581],"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.00000346561,0.00006970461,0.00006159457,0.000005687148,0.00001332003,1.318156e-7,0.00005815183,0.7686408,0.000004998299,0.2284953,0.0004225829,0.002224249],"study_design_scores_gemma":[0.0002558909,0.00001331241,0.0001115067,0.00001073244,0.00001036669,0.000009338147,0.00008066492,0.9145702,0.00004518967,0.08263823,0.002168614,0.00008598459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004492096,0.00003060656,0.9953355,0.002243604,0.00003552957,0.0007907641,0.00004014497,0.00004037363,0.0010343],"genre_scores_gemma":[0.05178915,0.0002044791,0.9433718,0.001235766,0.000113702,0.0005067529,0.00009212105,0.00005175623,0.002634411],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1459294,"threshold_uncertainty_score":0.6281858,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0298857818646566,"score_gpt":0.3180605713322898,"score_spread":0.2881747894676332,"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."}}