{"id":"W2328963229","doi":"10.11159/ijecs.2012.001","title":"Constrained Nonlinear Least Squares: A Superlinearly Convergent Projected Structured Secant Method","year":2012,"lang":"en","type":"article","venue":"International Journal of Electrical and Computer Systems","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Hessian matrix; Mathematics; Non-linear least squares; Nonlinear programming; Mathematical optimization; Least-squares function approximation; Nonlinear system; Line search; Quasi-Newton method; Secant method; Robustness (evolution); Applied mathematics; Convergence (economics); Algorithm; Newton's method; Computer science; Estimation theory","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.0009768547,0.0007360841,0.0006739561,0.0003778971,0.0002847589,0.0005198608,0.00103745,0.001108986,0.002852521],"category_scores_gemma":[0.002521727,0.0003496024,0.0004939187,0.0004605367,0.000692253,0.0005883028,0.001004097,0.001132115,0.0008349897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002982213,"about_ca_system_score_gemma":0.00114116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002588833,"about_ca_topic_score_gemma":0.002706062,"domain_scores_codex":[0.9995921,0.0001879307,0.00001386343,0.00003517998,0.0001479629,0.00002300263],"domain_scores_gemma":[0.9991185,0.0004418313,0.00006179257,0.00009646906,0.0002343728,0.0000469615],"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.0001140695,0.00006212282,0.0004913207,0.0001409335,0.00003287916,0.0001462864,0.00009372138,0.8995392,0.008739073,0.03704843,0.002982415,0.05060954],"study_design_scores_gemma":[0.000004931933,0.000008901971,0.00002012264,0.00000293792,0.000001052418,0.000007364442,0.000002581361,0.9978694,0.000410641,0.001254898,0.0004153007,0.00000197638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005032093,0.00006081451,0.992686,0.000084404,0.00002697451,0.00003505012,0.00003645846,0.0001697209,0.001868416],"genre_scores_gemma":[0.1249437,0.0001548072,0.8699176,0.0001464144,0.000031281,0.0002417417,0.0001611502,0.0002642534,0.004139019],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002852521,"threshold_uncertainty_score":0.009542644,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03507410735842744,"score_gpt":0.3571605187625237,"score_spread":0.3220864114040963,"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."}}