Volume 8, Issue 3
A Globally and Superlinearly Convergent Primal-Dual Interior Point Method for General Constrained Optimization

Jianling Li, Jian Lv & Jinbao Jian

Numer. Math. Theor. Meth. Appl., 8 (2015), pp. 313-335.

Published online: 2015-08

Preview Purchase PDF 2 1776
Export citation
  • Abstract

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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{NMTMA-8-313, 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 = {

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.

}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.2015.m1338}, url = {http://global-sci.org/intro/article_detail/nmtma/12412.html} }
TY - JOUR T1 - A Globally and Superlinearly Convergent Primal-Dual Interior Point Method for General Constrained Optimization JO - Numerical Mathematics: Theory, Methods and Applications VL - 3 SP - 313 EP - 335 PY - 2015 DA - 2015/08 SN - 8 DO - http://doi.org/10.4208/nmtma.2015.m1338 UR - https://global-sci.org/intro/article_detail/nmtma/12412.html KW - AB -

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.

Jianling Li, Jian Lv & Jinbao Jian. (2020). A Globally and Superlinearly Convergent Primal-Dual Interior Point Method for General Constrained Optimization. Numerical Mathematics: Theory, Methods and Applications. 8 (3). 313-335. doi:10.4208/nmtma.2015.m1338
Copy to clipboard
The citation has been copied to your clipboard