Please use this identifier to cite or link to this item:
|Title:||Semismooth Newton methods for solving semi-infinite programming problems||Authors:||Qi, L.
Semismooth Newton method
|Issue Date:||Nov-2003||Citation:||Qi, L., Wu, S.-Y., Zhou, G. (2003-11). Semismooth Newton methods for solving semi-infinite programming problems. Journal of Global Optimization 27 (2-3) : 215-232. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1024814401713||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.||Source Title:||Journal of Global Optimization||URI:||http://scholarbank.nus.edu.sg/handle/10635/130483||ISSN:||09255001||DOI:||10.1023/A:1024814401713|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.