Abstract:
The convergence of the method of feasible directions is proved for the case of the smooth objective function and a constraint in the form of the difference of convex sets (the so-called preconvex set). It is shown that the method converges to the set of stationary points, which generally is narrower than the corresponding set in the case of a smooth function and smooth constraints. The scheme of the proof is similar to that proposed earlier by Karmanov.
Key words:mathematical programming problems with preconvex constraints, classical method of feasible directions, method convergence.
Fulltext:
PDF file (851 kB)