Loading [MathJax]/jax/output/HTML-CSS/config.js
Go to previous page

A Globally and Superlinearly Convergent Primal-Dual Interior Point Method for General Constrained Optimization

A Globally and Superlinearly Convergent Primal-Dual Interior Point Method for General Constrained Optimization

Year:    2015

Numerical Mathematics: Theory, Methods and Applications, Vol. 8 (2015), Iss. 3 : pp. 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.

You do not have full access to this article.

Already a Subscriber? Sign in as an individual or via your institution

Journal Article Details

Publisher Name:    Global Science Press

Language:    English

DOI:    https://doi.org/10.4208/nmtma.2015.m1338

Numerical Mathematics: Theory, Methods and Applications, Vol. 8 (2015), Iss. 3 : pp. 313–335

Published online:    2015-01

AMS Subject Headings:   

Copyright:    COPYRIGHT: © Global Science Press

Pages:    23

Keywords:   

  1. A globally convergent QP-free algorithm for nonlinear semidefinite programming

    Li, Jian-Ling | Yang, Zhen-Ping | Jian, Jin-Bao

    Journal of Inequalities and Applications, Vol. 2017 (2017), Iss. 1

    https://doi.org/10.1186/s13660-017-1415-y [Citations: 2]
  2. A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization

    Li, Jianling | Yang, Zhenping

    Applied Mathematics and Computation, Vol. 316 (2018), Iss. P.52

    https://doi.org/10.1016/j.amc.2017.08.013 [Citations: 5]
  3. Transform Nonlinear Programming Problem to Initial-Value Problem to Solve, Part 1: Within the Feasible Region

    Zhang, Sheng | Liao, Fei | Kong, Yi-Nan | He, Kai-Feng

    2024 36th Chinese Control and Decision Conference (CCDC), (2024), P.3037

    https://doi.org/10.1109/CCDC62350.2024.10587508 [Citations: 0]