Level-constrained programming

摘要

We develop an infinitesimal algorithm for a class of programs in which the optimal value is known or imposed a priori. When well defined, the algorithm traces out a trajectory that furnishes, in finite time, a primal-dual pair satisfying the Fritz-John optimality condition. No assumption about strict feasibility is required.