A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs

Xin-Wei Liu (), Yu-Hong Dai () and Ya-Kui Huang ()
Additional contact information
Xin-Wei Liu: Hebei University of Technology
Yu-Hong Dai: Chinese Academy of Sciences
Ya-Kui Huang: Hebei University of Technology

Mathematical Methods of Operations Research, 2022, vol. 96, issue 3, No 2, 382 pages

Abstract: Abstract Based on solving an equivalent parametric equality constrained mini-max problem of the classic logarithmic-barrier subproblem, we present a novel primal-dual interior-point relaxation method for nonlinear programs with general equality and nonnegative constraints. In each iteration, our method approximately solves the KKT system of a parametric equality constrained mini-max subproblem, which avoids the requirement that any primal or dual iterate is an interior-point. The method has some similarities to the warmstarting interior-point methods in relaxing the interior-point requirement and is easily extended for solving problems with general inequality constraints. In particular, it has the potential to circumvent the jamming difficulty that appears with many interior-point methods for nonlinear programs and improve the ill conditioning of existing primal-dual interior-point methods as the barrier parameter is small. A new smoothing approach is introduced to develop our relaxation method and promote convergence of the method. Under suitable conditions, it is proved that our method can be globally convergent and locally quadratically convergent to the KKT point of the original problem. The preliminary numerical results on a well-posed problem for which many interior-point methods fail to find the minimizer and a set of test problems from the CUTEr collection show that our method is efficient.

Keywords: Nonlinear programming; Interior-point relaxation method; Smoothing method; Logarithmic-barrier problem; Mini-max problem; Global and local convergence; 90C26; 90C30; 90C51 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s00186-022-00797-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:96:y:2022:i:3:d:10.1007_s00186-022-00797-7

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s00186-022-00797-7

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().