{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00123144,0.0009645062,0.001201077,0.0006748823,0.0005105265,0.0008199559,0.001219747,0.0009215324,0.00387344],"category_scores_gemma":[0.002808609,0.0002929938,0.0006540412,0.000761126,0.0007795328,0.001622314,0.001160395,0.00217584,0.001522778],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000555355,"about_ca_system_score_gemma":0.001204798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001286644,"about_ca_topic_score_gemma":0.0006912437,"domain_scores_codex":[0.9991763,0.000315717,0.00002887821,0.00008734255,0.0003204996,0.00007118787],"domain_scores_gemma":[0.9993605,0.0003346172,0.00004625058,0.00004178216,0.0001754625,0.00004145021],"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.0003067934,0.0001722335,0.0006261232,0.0008246556,0.00009296525,0.0002477625,0.0002134494,0.5103393,0.01331528,0.2044463,0.01188436,0.2575307],"study_design_scores_gemma":[0.0000270799,0.00004629505,0.00006479882,0.00002106974,0.00000943702,0.00005605715,0.00001006507,0.9739032,0.002001743,0.01934501,0.004504701,0.0000105397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009772979,0.0001696806,0.9974325,0.00008005244,0.00002674418,0.00001137137,0.000008787492,0.000124578,0.001168906],"genre_scores_gemma":[0.1769635,0.00132783,0.8096939,0.000320059,0.0001670839,0.0004039313,0.0002478866,0.0006099667,0.01026585],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00387344,"threshold_uncertainty_score":0.01295793,"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."}}