山东大学学报（理学版） ›› 2016, Vol. 51 ›› Issue (4): 86-89.doi: 10.6040/j.issn.1671-9352.0.2015.384
崔安刚,李海洋*
CUI An-gang, LI Hai-yang*
摘要： 证明了仿射约束矩阵秩最小问题与无约束矩阵秩最小问题的等价性,即存在λ0>0,对于任意的λ∈(0,λ0),无约束矩阵秩最小问题与仿射约束矩阵秩最小问题有相同的最优解。通过求解无约束罚函数矩阵秩最小问题的最优解来近似替代仿射约束矩阵秩最小问题的最优解是可行的。
中图分类号:
| [1] CANDES E J, RECHT B. Exact matrix completion via convex optimization[J]. Foundations of Computational Mathematics, 2009, 9:717-772. [2] JANNACH D, ZANKER M, FELFERNIG A, FRIEDRICH G. Recommender systems: an introduction[M]. New York: Cambridge University Press, 2012: 38-40. [3] FAZEL M, HINDI H, BOYD S. A rank minimization heuristic with application to minimum order approximation[C] // Proceedings of the American Control Conference. Arlington: ACC Press, 2001, 6:4734-4739. [4] FAZEL M, HINDI H, BOYD S. Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices[C] // Proceedings of the American Control Conference. Denver: ACC Press, 2003, 3:2156-2162. [5] JI Senshan, ZHOU Zirui, ANTHONY M S, et al. Beyond convex relaxation: a polynomial-time non-convex optimization approach to network localization[C] // Proceedings of the 32nd IEEE International Conference on Computer Communications. Hungary: ICC Press, 2013, 10(11):2499-2507. [6] RECHT B, FAZEL M, PARRILO P A. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization[J]. SIAM Review, 2012, 52(3):471-501. [7] CAI Jianfeng, CANDES E J, SHEN Zuowei. A singular value thresholding algorithm for matrix completion[J]. SIAM Journal on Optimization, 2010, 20(4):1956-1982. [8] CANDES E J, TAO T. The power of convex relaxation: near-optimal matrix completion[J]. IEEE Transactions on Information Theory, 2010, 56(5):2053-2080. [9] RAGHUNANDAN H Keshavan, ANDREA Montanari, SEWOONG Oh. Matrix completion from a few entries[J]. IEEE Transactions on Information Theory, 2010, 56(6): 2980-2998. [10] LAI Mingjun, XU Yangyang, YIN Wotao. Improved iteratively reweighted least squares for unconstrained smoothed lq minimization[J]. SIAM Journal on Numerical Analysis, 2013, 51(2):927-957. [11] MA Shiqian, GOLDFARB D, CHEN Lifeng. Fixed point and bregman iterative methods for matrix rank minimization[J]. Mathematical Programming Computation, 2011, 128(12):321-353. [12] MOHAN K, FAZEL M. Iterative reweighted algorithms for matrix rank minimization[J]. The Journal of Machine Learning Research, 2012, 13(1):3441-3473. [13] WEN Zaiwen, YIN Wotao, ZHANG Yin. Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm[J]. Mathematical Programming Computation, 2012, 4(4):333-361. |
| [1] | 曹伟东,戴涛,于金彪,王晓宏,施安峰. 化学驱模型中压力方程的交替方向解法改进[J]. 山东大学学报（理学版）, 2018, 53(10): 88-94. |
| [2] | 刘园园,曹德欣,秦军. 非线性二层混合整数规划问题的区间算法[J]. 山东大学学报（理学版）, 2018, 53(2): 9-17. |
| [3] | 张静静,杨秀萍,刘清,张春秋. 基于Biot理论的腰椎间盘力学响应分析[J]. 山东大学学报（理学版）, 2016, 51(11): 93-98. |
| [4] | 陈玲,门玉涛,王加江. 种植术与分根术联合治疗术后牙体可靠性分析[J]. 山东大学学报（理学版）, 2016, 51(5): 6-10. |
| [5] | 刁群,石东洋. 拟线性黏弹性方程一个新的H 1-Galerkin混合有限元分析[J]. 山东大学学报（理学版）, 2016, 51(4): 90-98. |
| [6] | 王加江,陈玲,门玉涛,季辰. 缩短牙种植术与分根术联合修复周期的可行性研究[J]. 山东大学学报（理学版）, 2016, 51(3): 40-43. |
| [7] | 张厚超, 朱维钧, 王俊俊. 非线性四阶双曲方程一个低阶混合元方法的超收敛和外推[J]. 山东大学学报（理学版）, 2015, 50(12): 35-46. |
| [8] | 樊明智, 王芬玲, 石东洋. 广义神经传播方程最低阶新混合元格式的高精度分析[J]. 山东大学学报（理学版）, 2015, 50(08): 78-89. |
| [9] | 姜俊, 杨秀萍, 刘清, 张春秋. 压缩载荷下关节软骨溶质扩散的模拟[J]. 山东大学学报（理学版）, 2015, 50(01): 85-89. |
|
||
