{"id":"W4377115366","doi":"10.13001/ela.2023.7635","title":"Bounding real tensor optimizations via the numerical range","year":2023,"lang":"en","type":"article","venue":"Electronic Journal of Linear Algebra","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounding overwatch; Eigenvalues and eigenvectors; Semidefinite programming; Numerical range; Linear algebra; Tensor (intrinsic definition); Numerical linear algebra; Matrix (chemical analysis); Tensor product; Rank (graph theory); Subspace topology; Range (aeronautics); Linear programming; Upper and lower bounds; Positive-definite matrix; Numerical analysis; Algebra over a field; Combinatorics; Pure mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Computer science; Geometry","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.0006651675,0.0001060357,0.0002035996,0.0001241427,0.0003118637,0.00004216529,0.0002936783,0.00005011982,0.0001510649],"category_scores_gemma":[0.0001529979,0.00007199505,0.000171039,0.0006235644,0.00004494091,0.00009434325,0.0000302496,0.0004652945,0.0001374305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008127817,"about_ca_system_score_gemma":0.0001351849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003814115,"about_ca_topic_score_gemma":0.0000045354,"domain_scores_codex":[0.9986858,0.00009077627,0.000450024,0.00009908068,0.0002812563,0.0003930295],"domain_scores_gemma":[0.9988348,0.0004252766,0.0002827742,0.0002138649,0.0001632337,0.00008007714],"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.00009417391,0.0003808592,0.0005441845,0.00002727742,0.0004325483,0.00003339415,0.001624768,0.001501904,0.002930145,0.9539173,0.03550832,0.003005145],"study_design_scores_gemma":[0.002834827,0.0006709214,0.003709097,0.00009426816,0.0005493371,0.001722087,0.001126498,0.06223643,0.001520054,0.8297668,0.09512022,0.000649489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5335608,0.0005542972,0.4263273,0.03477016,0.0004534677,0.0006718469,0.00001652399,0.0004437217,0.003201971],"genre_scores_gemma":[0.9894078,0.0005706047,0.007723424,0.0002473241,0.0006738378,0.00001561997,0.000009369742,0.00004716393,0.001304829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4558471,"threshold_uncertainty_score":0.2935873,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02920302873916053,"score_gpt":0.3254095091602312,"score_spread":0.2962064804210707,"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."}}