{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001838594,0.0002126698,0.0002275384,0.0002008246,0.0004880342,0.0001783803,0.0002476233,0.00008095853,0.0001511155],"category_scores_gemma":[0.0003012079,0.0002159019,0.00006159822,0.0005055596,0.0001376976,0.0003329583,0.0001257211,0.0001133126,0.00001559553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006403444,"about_ca_system_score_gemma":0.00006504853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003103951,"about_ca_topic_score_gemma":6.587551e-7,"domain_scores_codex":[0.9984316,0.00003973916,0.0004927842,0.0004465431,0.0002938352,0.0002954634],"domain_scores_gemma":[0.997183,0.001181594,0.0002277312,0.000297443,0.0009383827,0.0001718071],"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.000002272397,0.000146931,0.00001280702,0.00006767759,0.00003054473,5.87246e-8,0.000150136,0.9034006,0.000007811922,0.06301945,0.000673446,0.03248828],"study_design_scores_gemma":[0.0007338643,0.00002768086,0.00003021342,0.00001618038,0.00001307993,0.000004065199,0.00008892521,0.7446274,0.00001178186,0.2525297,0.001738565,0.0001785777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003297755,0.00007112358,0.9949391,0.0009620431,0.00002554289,0.003247157,0.0001392612,0.0001933651,0.0003894177],"genre_scores_gemma":[0.00064205,0.00005398237,0.9927946,0.0001963676,0.00009200583,0.005120901,0.0005945203,0.00005505732,0.0004504616],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1895102,"threshold_uncertainty_score":0.8804225,"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."}}