@Article{NMTMA-8-3,
author = {},
title = {A Globally and Superlinearly Convergent Primal-Dual Interior Point Method for General Constrained Optimization},
journal = {Numerical Mathematics: Theory, Methods and Applications},
year = {2015},
volume = {8},
number = {3},
pages = {313--335},
abstract = {<p style="text-align: justify;">In this paper, a primal-dual interior point method is proposed for general constrained optimization, which incorporated a penalty function and a kind of new identification technique of the active set. At each iteration, the proposed algorithm only needs to solve two or three reduced systems of linear equations with the same coefficient matrix. The size of systems of linear equations can be decreased due to the introduction of the working set, which is an estimate of the active set. The penalty parameter is automatically updated and the uniformly positive definiteness condition on the Hessian approximation of the Lagrangian is relaxed. The proposed algorithm possesses global and superlinear convergence under some mild conditions. Finally, some preliminary numerical results are reported.</p>},
issn = {2079-7338},
doi = {https://doi.org/10.4208/nmtma.2015.m1338},
url = {https://global-sci.com/article/90576/a-globally-and-superlinearly-convergent-primal-dual-interior-point-method-for-general-constrained-optimization}
}