摘要
In this paper, a new algorithm for inequality constrained optimization problems is presented. The algorithm is feasible and is globally and superlinearly convergent under some weaker assumptions - without strict complementary condition.
In this paper, a new algorithm for inequality constrained optimization problems is presented. The algorithm is feasible and is globally and superlinearly convergent under some weaker assumptions - without strict complementary condition.