Previous Articles Next Articles
Taoran Fu^{1}, Dongdong Ge^{2}, Yinyu Ye^{3}
Taoran Fu, Dongdong Ge, Yinyu Ye. ON DOUBLY POSITIVE SEMIDEFINITE PROGRAMMING RELAXATIONS[J]. Journal of Computational Mathematics, 2018, 36(3): 391403.
[1] P. Biswas, T.C. Lian, T.C. Wang and Y. Ye, Semidefinite programming based algorithms for sensor network localization, ACM Trans. Sens. Netw., 2:2(2006), 188220. [2] I.M. Bomze and E. de Klerk, Solving standard quadratic optimization problems via linear, semidefinite and copositive programming, J. Global Optim., 24:2(2002), 163185. Dedicated to Professor Naum Z. Shor on his 65th birthday. [3] S. Burer, On the copositive representation of binary and continuous nonconvex quadratic programs, Math. Program., 120:2(2009), 479495. [4] S. Burer, K.M. Anstreicher and M. Dür, The difference between 5×5 doubly nonnegative and completely positive matrices, Linear Algebra Appl., 431:9(2009), 15391552. [5] H. Dong and K. Anstreicher, Separating doubly nonnegative and completely positive matrices, Math. Program., 137:1(2013), 131153. [6] M.X. Goemans and D.P. Williamson, Improved approximation algorithms for Maximum Cut and Satisfiability problems using semidefinite programming, J. ACM, 42:6(1995), 11151145. [7] B. Jiang, Z. Li and S. Zhang, On cones of nonnegative quartic forms, Found. Comput. Math., 17:1(2017), 161197. [8] B. Jiang, S. Ma and S. Zhang, Tensor principal component analysis via convex optimization, Math. Program., 150:2(2015), 423457. [9] P.M. Kleniati, P. Parpas and B.Rustem, Procedure for Polynomial Optimization:Application to Portfolio Decisions with Higher Order Moments, COMISEF, 2009. [10] Q. Kong, C. Lee, C.P. Teo and Z. Zheng, Scheduling Arrivals to a Stochastic Service Delivery System using Copositive Cones, Oper. Res., 61:3(2013), 711726. [11] K. Natarajan, C.P. Teo and Z. Zheng, Mixed zeroone linear programs under objective uncertainty:a completely positive representation, Oper. Res., 59:3(2011), 713728. [12] Yu.E. Nesterov, Semidefinite relaxation and nonconvex quadratic optimization, Optimiz. Meth. Software, 9:1(1998), 141160. Special Issue Celebrating the 60th Birthday of Professor Naum Shor. [13] P. Parrilo, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, PhD thesis, California Institute of Technology, 2000. [14] S. Poljak, F. Rendl and H. Wolkowicz. A recipe for semidefinite relaxation for (0, 1)quadratic programming. J. Global Optim., 7:1(1995), 5173. [15] W.F. Sheppard, On the calculation of the double integral expressing normal correlation, Trans. Camb. Philos. Soc., 19(1900), 2366. [16] Y. Ye, Approximating quadratic programming with bound and quadratic constraints, Math. Program., 84:2(1999), 219226. [17] Y. Ye, A.699approximation algorithm for MaxBisection, Math. Program., 90:1(2001), 101111. 
[1]  Yaolin Jiang, Zhen Miao. QUASINEWTON WAVEFORM RELAXATION BASED ON ENERGY METHOD [J]. Journal of Computational Mathematics, 2018, 36(4): 542562. 
[2]  Xi Yang. ON SOLVABILITY AND WAVEFORM RELAXATION METHODS FOR LINEAR VARIABLECOEFFICIENT DIFFERENTIALALGEBRAIC EQUATIONS [J]. Journal of Computational Mathematics, 2014, 32(6): 696720. 
[3]  Haibao Chen, Yaolin Jiang. AN ACCELERATED WAVEFORM RELAXATION APPROACH BASED ON MODEL ORDER REDUCTION FOR LARGE COUPLING SYSTEMS [J]. Journal of Computational Mathematics, 2013, 31(2): 190208. 
[4]  Mohammed Seaid . MULTIDIMENSIONAL RELAXATION APPROXIMATIONS FOR HYPERBOLIC SYSTEMS OFCONSERVATION LAWS [J]. Journal of Computational Mathematics, 2007, 25(4): 440457. 
[5]  Yaolin Jiang. WAVEFORM RELAXATION METHODS OF NONLINEAR INTEGRALDIFFERENTIALALGEBRAIC EQUATIONS [J]. Journal of Computational Mathematics, 2005, 23(1): 49128. 
[6]  Jian Yu PAN, Zhong Zhi BAI. ON THE CONVERGENCE OF WAVEFORM RELAXATION METHODS FOR LINEAR INITIAL VALUE PROBLEMS [J]. Journal of Computational Mathematics, 2004, 22(5): 681698. 
[7]  Zhong Zhi BAI,YU Guang HUANG. A CLASS OF ASYNCHRONOUS PARALLEL MULTISPLITTING RELAXATION METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS$^*1$ [J]. Journal of Computational Mathematics, 2003, 21(6): 773790. 
[8]  Zhong Zhi BAI,Xue Bin CHI. ASYMPTOTICALLY OPTIMAL SUCCESSIVE OVERRILAXATION METHODS FOR SYSTEMS OF LINEAR EQUATIONS$^*1$ [J]. Journal of Computational Mathematics, 2003, 21(5): 603612. 
[9]  Da Chuan XU,Ji Ye HAN. APPROXIMATION ALGORITHM FOR MAXBISECTION PROBLEM WITH THE POSITIVE SEMIDEFINITE RELAXATION [J]. Journal of Computational Mathematics, 2003, 21(3): 357366. 
[10]  Zhong Zhi BAI,Yu Guang HUANG. RELAXED ASYNCHRONOUS ITERATIONS FOR THE LINEAR COMPLEMENTARITY PROBLEM [J]. Journal of Computational Mathematics, 2002, 20(1): 97112. 
[11]  Zhongzhi Bai,Tinzhu Huang. ON THE CONVERGENCE OF THE RELAXATION METHODS FOR POSITIVE DEFINITELINEAR SYSTEMS [J]. Journal of Computational Mathematics, 1998, 16(6): 527538. 
[12]  Zhongzhi Bai,Deren Wang,D.J. Evans. A CLASS OF ASYNCHRONOUS MATRIX MULTISPLITTING MULTIPARAMETERRELAXATION ITERATIONS [J]. Journal of Computational Mathematics, 1998, 16(3): 221238. 
Viewed  
Full text 


Abstract 

