In this paper, a new mixed quasi-Newton method for inequality constrained optimization problems is proposed. The feature of the method is that only the systems of linear equations are solved in each iteration, other t...In this paper, a new mixed quasi-Newton method for inequality constrained optimization problems is proposed. The feature of the method is that only the systems of linear equations are solved in each iteration, other than the quadratic programming, which decrease the amount of computations and is also efficient for large scale problem. Under some mild assumptions without the strict complementary condition., the method is globally and superlinearly convergent.展开更多
In the paper, a new mixed algorithm combined with schemes of nonmonotone line search, the systems of linear equations for higher order modification and sequential quadratic programming for constrained optimizations is...In the paper, a new mixed algorithm combined with schemes of nonmonotone line search, the systems of linear equations for higher order modification and sequential quadratic programming for constrained optimizations is presented. Under some weaker assumptions,without strict complementary condition, the algorithm is globally and superlinearly convergent.展开更多
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 comp...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 mixed quasi-Newton method for inequality constrained optimization problems is proposed. The feature of the method is that only the systems of linear equations are solved in each iteration, other than the quadratic programming, which decrease the amount of computations and is also efficient for large scale problem. Under some mild assumptions without the strict complementary condition., the method is globally and superlinearly convergent.
文摘In the paper, a new mixed algorithm combined with schemes of nonmonotone line search, the systems of linear equations for higher order modification and sequential quadratic programming for constrained optimizations is presented. Under some weaker assumptions,without strict complementary condition, the algorithm is globally and superlinearly convergent.
文摘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.