Abstract: An algorithm for solving a class of smooth convex programming is given. Using smooth exact multiplier penalty function,a smooth convex programming is minimized to a minimizing strongly convex function on the compact set was reduced. Then the strongly convex function with a Newton method on the given compact set was minimized.

Key words: convex programming, Newton method, KKT multiplier