Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29512
Title: Semismooth Newton methods for solving semi-infinite programming problems
Authors: Qi, L 
Wu, SY
Zhou, G
Issue Date: 2003
Source: Journal of global optimization, 2003, v. 27, no. 2-3, p. 215-232
Abstract: In this paper we present some semismooth Newton methods for solving the semi-infinite programming problem. We first reformulate the equations and nonlinear complementarity conditions derived from the problem into a system of semismooth equations by using NCP functions. Under some conditions a solution of the system of semismooth equations is a solution of the problem. Then some semismooth Newton methods are proposed for solving this system of semismooth equations. These methods are globally and superlinearly convergent. Numerical results are also given.
Keywords: Semi-infinite programming
Semismooth equations
Semismooth Newton method
Publisher: Kluwer Academic Publ
Journal: Journal of global optimization 
ISSN: 0925-5001
EISSN: 1573-2916
DOI: 10.1023/A:1024814401713
Appears in Collections:Conference Paper

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

SCOPUSTM   
Citations

41
Last Week
0
Last month
0
Citations as of Aug 29, 2020

WEB OF SCIENCETM
Citations

40
Last Week
0
Last month
0
Citations as of Sep 18, 2020

Page view(s)

141
Last Week
0
Last month
Citations as of Sep 22, 2020

Google ScholarTM

Check

Altmetric


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