The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs

摘要

This paper develops a method for moving quickly and cheaply from an arbitrary initial point at an extreme JL distance from the feasible region to a point that is relatively near the feasible region of a nonlinearly con-strained model. The method is a variant of a projection algorithm that is shown to be robust, even in the presence of nonconvex constraints and infeasibility. Empirical results are presented.