This paper gives a new algorithm for both equality and inequality constrained optimization problems based on optimization theory.Being self-correcting of the penalty factor,the algorithm is close to the optimal entry. Then it proves the astringency of the algorithm under certain condition.At last,an example is given,based on numerical test result of MATLAB,the feasibility of this algorithm is proven.