A smoothing projected Newton-type algorithm for semi-infinite programming

Liqun Qi, Chen Ling, Xiaojiao Tong, Guanglu Zhou

Research output: Journal article publicationJournal articleAcademic researchpeer-review

24 Citations (Scopus)


This paper presents a smoothing projected Newton-type method for solving the semi-infinite programming (SIP) problem. We first reformulate the KKT system of the SIP problem into a system of constrained nonsmooth equations. Then we solve this system by a smoothing projected Newton-type algorithm. At each iteration only a system of linear equations needs to be solved. The feasibility is ensured via the aggregated constraint under some conditions. Global and local superlinear convergence of this method is established under some standard assumptions. Preliminary numerical results are reported.
Original languageEnglish
Pages (from-to)1-30
Number of pages30
JournalComputational Optimization and Applications
Issue number1
Publication statusPublished - 1 Jan 2009


  • Constrained equations
  • Convergence
  • KKT system
  • Semi-infinite programming
  • Smoothing method

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics
  • Control and Optimization


Dive into the research topics of 'A smoothing projected Newton-type algorithm for semi-infinite programming'. Together they form a unique fingerprint.

Cite this