{"id":"W1601244479","doi":"","title":"The Eigenstep Method: An Iterative Method for Unconstrained Quadratic Optimization","year":2005,"lang":"en","type":"article","venue":"American Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Line search; Mathematical optimization; Hessian matrix; Gradient descent; Mathematics; Broyden–Fletcher–Goldfarb–Shanno algorithm; Gradient method; Method of steepest descent; Convergence (economics); Quadratic programming; Convex optimization; Iterative method; Descent (aeronautics); Applied mathematics; Regular polygon; Computer science; Artificial neural network; Artificial intelligence","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":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01173173,0.0001819376,0.0003975696,0.000411828,0.001071368,0.000405747,0.0006350083,0.00005412113,0.0002282909],"category_scores_gemma":[0.008429453,0.0001233503,0.0001383396,0.0009528907,0.0005399699,0.0008699591,0.00007014588,0.0006646405,0.000006667387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003561692,"about_ca_system_score_gemma":0.001209824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001117075,"about_ca_topic_score_gemma":0.0000375033,"domain_scores_codex":[0.9939941,0.002516542,0.0009366802,0.0002821252,0.001730786,0.0005397677],"domain_scores_gemma":[0.9812701,0.01152904,0.0004249444,0.0003315613,0.006141655,0.00030271],"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.0005018048,0.0002409723,0.00001303363,0.00001225864,0.0001661575,0.000005512451,0.001689051,0.6973241,0.0007868817,0.08441121,0.002238131,0.2126109],"study_design_scores_gemma":[0.0009118325,0.001446341,0.000009093112,0.00002831011,0.00001863452,0.0001352095,0.004238156,0.9716294,0.001483539,0.01370787,0.006225924,0.0001656654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000595147,0.00007979843,0.9899011,0.008062913,0.00005083511,0.0007079302,0.00002203635,0.00001378276,0.0005664748],"genre_scores_gemma":[0.007480527,0.00008476381,0.9899385,0.0001939449,0.0006122024,0.00009776282,0.00001594552,0.00004888382,0.001527483],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2743053,"threshold_uncertainty_score":0.999923,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1302454921755974,"score_gpt":0.5364030428115195,"score_spread":0.4061575506359222,"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."}}