{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003787085,0.0008905466,0.001453917,0.0009368311,0.0004743209,0.001273288,0.0009633239,0.0014648,0.001650058],"category_scores_gemma":[0.01210724,0.0004601719,0.0005220643,0.001107206,0.002291182,0.00263057,0.001826331,0.002261202,0.0005680204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007732463,"about_ca_system_score_gemma":0.001260662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001745141,"about_ca_topic_score_gemma":0.001201919,"domain_scores_codex":[0.9985853,0.0006145323,0.00007043272,0.0001521729,0.000488907,0.00008856674],"domain_scores_gemma":[0.9966311,0.002507944,0.000208474,0.000214834,0.0003375986,0.0001000207],"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.0001114994,0.00007505052,0.0004372107,0.0001772691,0.00003603124,0.0001646623,0.0001438754,0.4838474,0.002788807,0.4364851,0.0021756,0.07355748],"study_design_scores_gemma":[0.00001258207,0.00003931251,0.00007489702,0.0000240162,0.000002912749,0.00005049564,0.0000109257,0.9186673,0.0005539669,0.0791631,0.001388534,0.00001189873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00476539,0.0004163432,0.9925599,0.000194722,0.00002563977,0.0000286398,0.00001795035,0.00006347936,0.001927893],"genre_scores_gemma":[0.2817257,0.00166025,0.7081799,0.0003712278,0.0001670673,0.0002726779,0.0002147737,0.0002004066,0.007208112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003787085,"threshold_uncertainty_score":0.02002823,"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."}}