On the global convergence of interior-point nonlinear programming algorithms

carathéodory's lemma states that if we have a linear combination of vectors in n, we can rewrite this combination using a linearly independent subset. this lemma has been successfully applied in nonlinear optimization in many contexts. in this work we present a new version of this celebrated result, in which we obtained new bounds for the size of the coefficients in the linear combination and we provide examples where these bounds are useful. we show how these new bounds can be used to prove that the internal penalty method converges to kkt points, and we prove that the hypothesis to obtain this result cannot be weakened.the new bounds also provides us some new results of convergence for the quasi feasible interior point ？2-penalty method of chen and goldfarb [7]. mathematical subject classification: 90c30, 49k99, 65k05.