A Smoothing Approach for Semi-infinite Programming with Projected Newton-type Algorithm
In this paper we apply the projected Newton-type algorithm to solve semi-infinite programming problems. The infinite constraints are replaced by an equivalent nonsmooth function which is then approximated by a smoothing function. The KKT system is formulated as a nonsmooth equation. We then apply th...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
Universal Academy Press, Inc
2007
|
| Online Access: | http://hdl.handle.net/20.500.11937/40355 |