{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001508361,0.0008557575,0.0009312868,0.0004437562,0.000319234,0.0006750469,0.0008635247,0.00123619,0.003400845],"category_scores_gemma":[0.003410626,0.0003153314,0.0004063375,0.0004905134,0.001038284,0.001139302,0.001230365,0.001556069,0.0007032084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00047354,"about_ca_system_score_gemma":0.001106423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001260247,"about_ca_topic_score_gemma":0.001423106,"domain_scores_codex":[0.9993736,0.0002949364,0.0000208777,0.0000643516,0.0002063086,0.00003996595],"domain_scores_gemma":[0.9986606,0.0008630467,0.000086873,0.0001113926,0.0002050811,0.00007301563],"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.0001244904,0.00008026105,0.0002547105,0.000187502,0.00002845391,0.000115274,0.00005829212,0.8655924,0.005893033,0.07868994,0.002744792,0.04623087],"study_design_scores_gemma":[0.000005717558,0.00001404374,0.00001458969,0.000003254189,7.929042e-7,0.000009282114,0.000002513583,0.9958766,0.0003078834,0.00332798,0.0004352031,0.000002261214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003328544,0.00006250603,0.9952524,0.0001042015,0.0000266784,0.00002085287,0.00001687155,0.00007720762,0.001110727],"genre_scores_gemma":[0.2213513,0.0002234497,0.771838,0.0001987564,0.00007945969,0.000250813,0.0001654016,0.0002148065,0.005677975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003400845,"threshold_uncertainty_score":0.01137692,"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."}}