in this talk, a new sequential quadratically constrained quadratic programming (sqcqp) algorithm is presented for nonlinear programming. at each iteration of an sqcqp method, a quadratically constrained quadratic program (qcqp) subproblem is solved followed by a line search. if an l-infinity penalty function is used as a merit function, this method is shown to have global convergent property under the mfcq and other mild conditions. no convexity assumptions are made concerning the objective and constraints. finally numerical results from the cutest test collection will be given to justify our theoretical prediction.