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.
| Original language | English |
|---|---|
| Pages (from-to) | 215-232 |
| Number of pages | 18 |
| Journal | Journal of Global Optimization |
| Volume | 27 |
| Issue number | 2-3 |
| DOIs | |
| Publication status | Published - 1 Nov 2003 |
Keywords
- Semi-infinite programming
- Semismooth equations
- Semismooth Newton method
ASJC Scopus subject areas
- Computer Science Applications
- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics