An improved feasible QP-free algorithm for inequality constrained optimization |
| |
Authors: | Zhi Bin Zhu Jin Bao Jian |
| |
Affiliation: | 1. College of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin, 541004, P. R. China 2. College of Mathematics and Informational Science, Guangxi University, Nanning, 510004, P. R. China 3. College of Mathematics and Informational Science, Yulin Normal University, Yulin, 537000, P. R. China
|
| |
Abstract: | In this paper, an improved feasible QP-free method is proposed to solve nonlinear inequality constrained optimization problems. Here, a new modified method is presented to obtain the revised feasible descent direction. In view of the computational cost, the most attractive feature of the new algorithm is that only one system of linear equations is required to obtain the revised feasible descent direction. Thereby, per single iteration, it is only necessary to solve three systems of linear equations with the same coefficient matrix. In particular, without the positive definiteness assumption on the Hessian estimate, the proposed algorithm is still global convergence. Under some suitable conditions, the superlinear convergence rate is obtained. |
| |
Keywords: | Inequality constrained optimization feasible QP-free method system of linear equations global convergence superlinear convergence rate |
本文献已被 CNKI 维普 SpringerLink 等数据库收录! |
|