{"id":"W3125016700","doi":"10.48550/arxiv.2101.08830","title":"On the Frank-Wolfe algorithm for non-compact constrained optimization problems","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Apoio à Pesquisa do Distrito Federal; Fundação de Amparo à Pesquisa do Estado de Goiás; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Centre de Recherches Mathématiques","keywords":"Lipschitz continuity; Mathematics; Sequence (biology); Mathematical optimization; Class (philosophy); Constraint (computer-aided design); Cone (formal languages); Compact space; Function (biology); Convex function; Set (abstract data type); Optimization problem; Gradient method; Feasible region; Regular polygon; Convex optimization; Constrained optimization; Algorithm; Computer science; Pure mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002989927,0.0002569032,0.0002919477,0.0002062132,0.0003008771,0.0003435794,0.001071133,0.0001906693,0.0002042874],"category_scores_gemma":[0.00006776897,0.0002277362,0.0003190933,0.0007933748,0.00006387259,0.0002698487,0.0003307365,0.0002856583,0.00001562591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001216935,"about_ca_system_score_gemma":0.0003032796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005431218,"about_ca_topic_score_gemma":0.000006765857,"domain_scores_codex":[0.99848,0.0001263754,0.0002206331,0.0008093751,0.000132229,0.0002313385],"domain_scores_gemma":[0.9980085,0.0003560267,0.0002905197,0.0007678521,0.0004752074,0.0001018571],"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.000003717263,0.00007991605,0.00002879377,0.00001456564,0.0001490711,0.000007871088,0.0001440048,0.8909587,0.000002045862,0.1079851,0.0003678913,0.0002584252],"study_design_scores_gemma":[0.0004268587,0.00003516169,0.00005576178,0.00005414812,0.00007917824,0.00000108282,0.00005748475,0.9904369,0.00003329302,0.008483879,0.00007291813,0.0002633451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008097968,0.00000881174,0.9957111,0.001082558,0.000305191,0.0005265006,0.000042495,0.0001068878,0.001406674],"genre_scores_gemma":[0.9245753,0.0000872474,0.07276323,0.0006836368,0.00008313384,0.000005479988,0.0002684941,0.00002040103,0.001513097],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9237655,"threshold_uncertainty_score":0.9286813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04931149180401834,"score_gpt":0.1868490407195227,"score_spread":0.1375375489155044,"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."}}