A version of the penalty method with approximation of the epigraphs of auxiliary functions

Abstract

A method for solving the convex programming problem, which is ideologically close to the known methods of external penalties, was proposed. The method uses auxiliary functions that are built on the general form of the penalty functions. In order to find approximations, the epigraphs of these auxiliary functions, as well as the original problem's domain of constraints, were immersed in certain polyhedral sets. In this regard, the problems of finding the iterative points are the linear programming problems, in which the constraints are the sets that approximate the epigraphs and a polyhedron containing an admissible set. The approximating sets were constructed using the traditional cutting of iterative points by planes. The peculiarity of the method is that it enables a periodic up­date of the approximating sets by discarding the cutting planes. The convergence of the proposed method was proved. Its implementation was discussed.

Keywords

• conditional minimization
• iterative point
• convergence
• penalty function
• epigraph
• approximating set
• cutting hyperplane