A local search method for optimization problem with d.c. inequality constraints

In addition, the relations between an approximate solution of linearized convex problem and the KKT-vector of the original problem are established, and the various stopping criteria are substantiated. Besides, we established the relations among the Lagrange multipliers of the original problem, those ones of the linearized problem, and the value of the penalty parameter. Finally, a preliminary computational testing of the LSM developed has been carried out on several test problems taken from literature.