On the stationarity for nonlinear optimization problems with polyhedral constraints

For polyhedral constrained optimization problems and a feasible point , it is shown that the projection of the negative gradient on the tangent cone, denoted , has an orthogonal decomposition of the form . At a stationary point, so reflects the distance to a stationary point. Away from a stationary point, and measure different aspects of optimality since only vanishes when the KKT multipliers at have the correct sign, while only vanishes when is a stationary point in the active manifold. As an application of the theory, an active set algorithm is developed for convex quadratic programs which adapts the flow of the algorithm based on a comparison between and .