\indent the talk will review semidefinite programming (sdp) relaxations for polynomial optimization and show how to solve them. we propose regularization type methods to solve such large scale sdp problems. significantly bigger problems would be solved, which is not possible by using prior existing methods like interior-point algorithms. numerical examples will also be shown.