Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/20007
Title: A smoothing projected Newton-type algorithm for semi-infinite programming
Authors: Qi, L 
Ling, C
Tong, X
Zhou, G
Keywords: Constrained equations
Convergence
KKT system
Semi-infinite programming
Smoothing method
Issue Date: 2009
Publisher: Springer
Source: Computational optimization and applications, 2009, v. 42, no. 1, p. 1-30 How to cite?
Journal: Computational optimization and applications 
Abstract: 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.
URI: http://hdl.handle.net/10397/20007
ISSN: 0926-6003
EISSN: 1573-2894
DOI: 10.1007/s10589-007-9117-x
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

17
Last Week
0
Last month
0
Citations as of Oct 10, 2017

WEB OF SCIENCETM
Citations

15
Last Week
0
Last month
0
Citations as of Oct 7, 2017

Page view(s)

38
Last Week
1
Last month
Checked on Oct 22, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.