{"id":"W3002304143","doi":"10.1007/s11590-020-01609-9","title":"A perturbation view of level-set methods for convex optimization","year":2020,"lang":"en","type":"preprint","venue":"Optimization Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Seikei University","keywords":"Parameterized complexity; Duality (order theory); Mathematics; Mathematical optimization; Set (abstract data type); Regular polygon; Convex set; Convex optimization; Constraint (computer-aided design); Limiting; Perturbation (astronomy); Feasible region; Computer science; Combinatorics; Physics; Engineering; Geometry","routes":{"ca_aff":true,"ca_fund":false,"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.004586058,0.0009062181,0.001078112,0.001497854,0.0005838386,0.00256462,0.001731036,0.001418533,0.005916686],"category_scores_gemma":[0.008746542,0.0007719749,0.001488017,0.001119392,0.0034321,0.002998478,0.003335929,0.005616512,0.001338414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001729057,"about_ca_system_score_gemma":0.001081314,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001145177,"about_ca_topic_score_gemma":0.0007142703,"domain_scores_codex":[0.9976745,0.001140636,0.00008419371,0.0001967178,0.0008064729,0.00009747509],"domain_scores_gemma":[0.9951834,0.003387438,0.0002634496,0.0004498054,0.0005017488,0.0002141319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003427015,0.00002728143,0.000140751,0.00009166655,0.00004255766,0.00005146963,0.00007195703,0.1826385,0.001903316,0.8017306,0.001748425,0.01151927],"study_design_scores_gemma":[0.000007556512,0.00002587021,0.00003846542,0.00002711943,0.000006456145,0.00002102274,0.0000116065,0.7580249,0.0008284067,0.237548,0.003450686,0.000009905812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0013635,0.0002414305,0.9938402,0.0004537982,0.00005680871,0.00001705217,0.00002894104,0.0000632447,0.003935151],"genre_scores_gemma":[0.3360928,0.002011794,0.6451648,0.00104411,0.0005527168,0.0004306647,0.000242332,0.0005567316,0.01390413],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005916686,"threshold_uncertainty_score":0.02425367,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07606464728142957,"score_gpt":0.3253525987141181,"score_spread":0.2492879514326886,"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."}}