{"id":"W2914773211","doi":"10.1093/imanum/dry069","title":"An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems","year":2018,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Hong Kong Polytechnic University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Penalty method; Mathematics; Mathematical optimization; Rank (graph theory); Lipschitz continuity; Matrix (chemical analysis); Constraint (computer-aided design); Convergence (economics); Differentiable function; Positive-definite matrix; Hessian matrix; Constrained optimization; Stationary point; Optimization problem; Semidefinite programming; Applied mathematics; Eigenvalues and eigenvectors; Combinatorics; Mathematical analysis","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.0004693715,0.0001854251,0.0005594437,0.0004603974,0.00008364411,0.0000901617,0.0002482557,0.00009087197,0.0001829305],"category_scores_gemma":[0.00009350288,0.0001525352,0.000448185,0.0009477384,0.00005312112,0.0002583788,0.00001380792,0.0001738831,0.000002993172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005470599,"about_ca_system_score_gemma":0.00002565149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002973068,"about_ca_topic_score_gemma":0.000003194368,"domain_scores_codex":[0.9985904,0.00009495913,0.0006646617,0.0001642868,0.0002416585,0.0002440956],"domain_scores_gemma":[0.9986286,0.0001663017,0.0002980109,0.0002317285,0.0005166317,0.0001587189],"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.00005803558,0.0000833813,0.0003351531,0.00001663278,0.001261147,0.00000954453,0.0001363395,0.9752719,0.01439921,0.00004185245,0.000740595,0.007646208],"study_design_scores_gemma":[0.0003084386,0.0002996586,0.0001123549,0.00003849915,0.001078986,0.00004879239,0.00004864424,0.9852391,0.01156229,0.0006544889,0.0004164999,0.0001921854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009903171,0.0001971832,0.9892758,0.0001340125,0.00008584707,0.00009254673,0.00001062485,0.0001305823,0.0001702592],"genre_scores_gemma":[0.5652692,0.00004824806,0.4343795,0.00005811533,0.0002029393,0.000002839781,0.000009253744,0.00002171441,0.000008127058],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5553661,"threshold_uncertainty_score":0.6220205,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01490434474217937,"score_gpt":0.3048581835835562,"score_spread":0.2899538388413768,"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."}}