{"id":"W2117753887","doi":"10.1080/10556780802414049","title":"An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners","year":2008,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Preconditioner; Solver; Mathematics; Path (computing); Iterative method; Interior point method; Regular polygon; Linear programming; Mathematical optimization; Algorithm; Computer science","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.001073612,0.0009417133,0.001030949,0.0005149912,0.0005886932,0.0007456082,0.001368366,0.001321028,0.005621924],"category_scores_gemma":[0.002471337,0.0005308891,0.0007915772,0.0005576655,0.0007646009,0.001091003,0.001610239,0.002928564,0.001714926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000627432,"about_ca_system_score_gemma":0.00212617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002976493,"about_ca_topic_score_gemma":0.003409935,"domain_scores_codex":[0.9994978,0.0001591146,0.00002700187,0.00008759976,0.0001775873,0.00005097165],"domain_scores_gemma":[0.999255,0.0003652684,0.00006730949,0.00009772052,0.0001664825,0.00004815198],"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.0002033308,0.0001527924,0.0006622524,0.0002655198,0.00007067181,0.0001972939,0.0002232143,0.6247709,0.009780877,0.08242561,0.008382579,0.272865],"study_design_scores_gemma":[0.00002462673,0.00003086675,0.00003388366,0.000008843685,0.000004042937,0.00003154147,0.000006195284,0.9918349,0.001134736,0.004478266,0.002403704,0.000008433128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00108349,0.00003518102,0.9977938,0.00005269332,0.00001987411,0.00004292013,0.00001268207,0.0001759143,0.0007833826],"genre_scores_gemma":[0.03528968,0.00008995488,0.9620042,0.00007876405,0.00002383803,0.0002613009,0.00009831104,0.0001291191,0.002024701],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005621924,"threshold_uncertainty_score":0.01880717,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07167003668825579,"score_gpt":0.4218804857570916,"score_spread":0.3502104490688359,"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."}}