{"id":"W2059043079","doi":"10.5539/mas.v2n4p144","title":"Logarithmic Barrier Function Method for Convex Quadratic Programming Problem","year":2008,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Interior point method; Quadratic programming; Logarithm; Mathematical optimization; Function (biology); Simple (philosophy); Second-order cone programming; Penalty method; Mathematics; Quadratic equation; Convex optimization; Sequential quadratic programming; Point (geometry); Quadratic function; Regular polygon; Quadratically constrained quadratic program; Computer science; Mathematical analysis; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001392678,0.000180648,0.000248394,0.0002238348,0.0009015749,0.00009002288,0.0004421287,0.00007572103,0.0000443231],"category_scores_gemma":[0.0003797065,0.0001645822,0.00005232851,0.0007911983,0.0005501622,0.0003234302,0.0001217969,0.0001948767,0.00002487045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001816772,"about_ca_system_score_gemma":0.0003747379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003079341,"about_ca_topic_score_gemma":0.000004061975,"domain_scores_codex":[0.9975472,0.00003109318,0.0003331439,0.000635306,0.0008235073,0.0006297518],"domain_scores_gemma":[0.9986169,0.0002706012,0.0001375571,0.0004173615,0.0003625972,0.0001949553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003229294,0.000627617,0.00008374947,0.0005472965,0.00006563533,0.00001174469,0.009384482,0.02312098,0.3583888,0.23111,0.0008491895,0.3754877],"study_design_scores_gemma":[0.0005822837,0.00006619667,0.00001076414,0.000008660146,0.00001118219,0.0000170981,0.0001404884,0.8138213,0.005908176,0.1781238,0.001100648,0.0002093754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005813137,0.00001443564,0.9947844,0.00008480512,0.00006350312,0.001916666,0.000004318403,0.0002109566,0.002339659],"genre_scores_gemma":[0.1011398,0.000003017148,0.8963463,0.00009191848,0.00004675503,0.0007784755,0.000004002173,0.00003574111,0.00155399],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7907003,"threshold_uncertainty_score":0.6934276,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0734569357767509,"score_gpt":0.3737475867186096,"score_spread":0.3002906509418587,"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."}}