{"id":"W66820110","doi":"10.1023/a:1013040428127","title":"Complexity of a Noninterior Path-Following Method for the Linear Complementarity Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Lambda; Linear complementarity problem; Eigenvalues and eigenvectors; Matrix (chemical analysis); Upper and lower bounds; Positive-definite matrix; Interior point method; Mathematical analysis; Physics; Algorithm","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.001742685,0.00009701221,0.0002453801,0.00008523413,0.0002982019,0.00002755301,0.0002268732,0.00003793403,0.0002396615],"category_scores_gemma":[0.0003406763,0.00006956851,0.0001296979,0.0002410671,0.0001510872,0.0001587052,0.00004916938,0.0001451031,5.759549e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002914388,"about_ca_system_score_gemma":0.00002178762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001076564,"about_ca_topic_score_gemma":8.155482e-7,"domain_scores_codex":[0.9987662,0.0001945485,0.0005967991,0.000109435,0.0002105227,0.000122534],"domain_scores_gemma":[0.9968099,0.001894128,0.0005796758,0.0001909073,0.0004643996,0.00006098285],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001425547,0.0005086672,0.0000631668,0.0001550017,0.0002948623,6.744435e-7,0.001250948,0.2984018,0.0002560569,0.6810163,0.0004945713,0.01741534],"study_design_scores_gemma":[0.001099533,0.000122018,0.00001071729,0.00004839497,0.000159849,0.0000300604,0.0008258792,0.7994561,0.0004507515,0.1948402,0.002850447,0.0001060778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000758911,0.0001992755,0.997824,0.0007765614,0.0000249517,0.0008231528,0.00003612158,0.00001191129,0.000228196],"genre_scores_gemma":[0.007876814,0.0001518062,0.991509,0.00006767417,0.00007788004,0.0001008614,0.000006339686,0.00001823247,0.0001914123],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5010542,"threshold_uncertainty_score":0.2836922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1135553928563568,"score_gpt":0.4153717938177717,"score_spread":0.3018164009614149,"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."}}