Data Randomness Makes Optimization Problems Easier to Solve ?
暂无分享,去创建一个
[1] Amit Singer,et al. Tightness of the maximum likelihood semidefinite relaxation for angular synchronization , 2014, Math. Program..
[2] Yinyu Ye,et al. Conditions for Correct Sensor Network Localization Using SDP Relaxation , 2013 .
[3] Emmanuel J. Candès,et al. PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming , 2011, ArXiv.
[4] Zhi-Quan Luo,et al. Semidefinite Relaxation of Quadratic Optimization Problems , 2010, IEEE Signal Processing Magazine.
[5] Anthony Man-Cho So,et al. Probabilistic analysis of the semidefinite relaxation detector in digital communications , 2010, SODA '10.
[6] Shuzhong Zhang,et al. New Results on Quadratic Minimization , 2003, SIAM J. Optim..
[7] Shang-Hua Teng,et al. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.
[8] Michael J. Todd,et al. Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems , 2001, Math. Program..
[9] Yinyu Ye,et al. Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming , 1999, Math. Oper. Res..
[10] Yinyu Ye,et al. Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming , 1994, Math. Oper. Res..
[11] Michael J. Todd,et al. Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems , 1986, Math. Program..
[12] Nimrod Megiddo,et al. A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension , 1984, STOC '84.
[13] Stephen Smale,et al. On the average number of steps of the simplex method of linear programming , 1983, Math. Program..