we study how to solve sum of squares (sos) and lasserre's relaxations for large scale polynomial optimization. when interior-point type methods are used, typically only small or moderately large problems could be solved. this paper proposes the regularization type methods which would solve significantly larger problems. we first describe these methods for general conic semidefinite optimization, and then apply them to solve large scale polynomial optimization. their efficiency is demonstrated by extensive numerical computations. in particular, a general dense quartic polynomial optimization with 100 variables would be solved on a regular computer, which is almost impossible by applying prior existing sos solvers.