{"id":"W2145896656","doi":"10.1007/s10589-013-9547-6","title":"A derivative-free approximate gradient sampling algorithm for finite minimax problems","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":51,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Line search; Minimax; Proximal Gradient Methods; Gradient descent; Gradient method; Stationary point; Directional derivative; Subderivative; Function (biology); Simplex; Descent direction; Mathematical optimization; Applied mathematics; Convergence (economics); Algorithm; Mathematical analysis; Convex function; Combinatorics; Convex optimization; Regular polygon; Geometry; RADIUS; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.00215558,0.0008860573,0.001750349,0.0008910381,0.0006018718,0.001170594,0.002223081,0.001979475,0.004699744],"category_scores_gemma":[0.007198816,0.0007432083,0.00072837,0.001020514,0.0009025404,0.001385616,0.001939241,0.002434899,0.001395855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007585536,"about_ca_system_score_gemma":0.001795429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003266435,"about_ca_topic_score_gemma":0.004773682,"domain_scores_codex":[0.9992199,0.0002298524,0.00004183764,0.00008939922,0.0003740856,0.00004485746],"domain_scores_gemma":[0.9983052,0.0009194949,0.00006389487,0.0001942339,0.0003999589,0.0001172009],"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.0005121758,0.000275443,0.0006836821,0.0002744297,0.0001247393,0.000136653,0.0001509571,0.5156437,0.009262834,0.07000054,0.007684957,0.39525],"study_design_scores_gemma":[0.00003319477,0.00003330452,0.00004848058,0.000008470792,0.000007012722,0.00002760244,0.000004468871,0.9916881,0.0006261623,0.006404208,0.001111769,0.000007224394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002560786,0.0001233071,0.9959921,0.00007161051,0.00006257487,0.00004441066,0.00002071478,0.0002093975,0.0009151393],"genre_scores_gemma":[0.07945072,0.0001616145,0.915409,0.0001469679,0.00009458398,0.0003037456,0.000163071,0.0002318719,0.004038505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004699744,"threshold_uncertainty_score":0.01572222,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06588151631744103,"score_gpt":0.3432997407118499,"score_spread":0.2774182243944088,"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."}}