{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007543546,0.001250576,0.001366316,0.001720157,0.001025275,0.002631524,0.002206589,0.001613792,0.01134528],"category_scores_gemma":[0.04460017,0.0006678143,0.0009582745,0.001330207,0.003726036,0.006580994,0.003668416,0.006569588,0.002525034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001863451,"about_ca_system_score_gemma":0.002450018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002370286,"about_ca_topic_score_gemma":0.001670245,"domain_scores_codex":[0.9973255,0.001297117,0.00009666925,0.000224647,0.0007272486,0.0003288116],"domain_scores_gemma":[0.9675912,0.02537882,0.001027551,0.001856294,0.002998286,0.001147865],"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.0006056335,0.00009532274,0.0009980068,0.0003106023,0.00003512213,0.0001286461,0.0002391792,0.05622606,0.003527877,0.8999589,0.01065727,0.02721733],"study_design_scores_gemma":[0.00006138394,0.00008398172,0.0003576608,0.00007392993,0.00002185168,0.00009072037,0.00005474006,0.593713,0.002039788,0.3986937,0.004778729,0.00003048155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05187663,0.005668923,0.8549022,0.006817537,0.001050371,0.0001173832,0.0003085484,0.0009269375,0.07833145],"genre_scores_gemma":[0.765513,0.005058976,0.1713054,0.002788842,0.001382668,0.0005153926,0.0006138402,0.002158361,0.05066355],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01134528,"threshold_uncertainty_score":0.03989458,"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."}}