Minimizing Sequences in a Constrained DC Optimization Problem

A smooth nonconvex optimization problem is considered, where the equality and inequality constraints and the objective function are given by DC functions. First, the original problem is reduced to an unconstrained problem with the help of I. I. Eremin’s exact penalty theory, and the objective function of the penalized problem also turns out to be a DC function. Necessary and sufficient conditions for minimizing sequences of the penalized problem are proved. On this basis, a “theoretical method” for constructing a minimizing sequence in the penalized problem with a fixed penalty parameter is proposed and the convergence of the method is proved. A well-known local search method and its properties are used for developing a new global search scheme based on global optimality conditions with a varying penalty parameter. The sequence constructed using the global search scheme turns out to be minimizing in the “limit” penalized problem, and each of its terms superscript𝑧𝑘1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$z^{k+1}$$\end{document} turns out to be an approximately critical vector for the local search method and an approximate solution of the current penalized problem ≜subscript𝒫𝑘subscript𝒫subscript𝜎𝑘\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\mathcal{P}_{k})\triangleq(\mathcal{P}_{\sigma_{k}})$$\end{document}. Finally, under an additional condition of “approximate feasibility,” the constructed sequence turns out to be minimizing for the original problem with DC constraints.