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 |
| id |
curtin-20.500.11937-40355 |
|---|---|
| recordtype |
eprints |
| spelling |
curtin-20.500.11937-403552017-01-30T14:41:53Z A Smoothing Approach for Semi-infinite Programming with Projected Newton-type Algorithm Feng, Zhi Teo, Kok Rehbock, Volker M. Fukushima, et al 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 the projected Newton-type algorithm to solve this equation and show that the accumulation point satisfies the KKT system. Some numerical results are presented for illustration. 2007 Conference Paper http://hdl.handle.net/20.500.11937/40355 Universal Academy Press, Inc restricted |
| repository_type |
Digital Repository |
| institution_category |
Local University |
| institution |
Curtin University Malaysia |
| building |
Curtin Institutional Repository |
| collection |
Online Access |
| description |
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 the projected Newton-type algorithm to solve this equation and show that the accumulation point satisfies the KKT system. Some numerical results are presented for illustration. |
| author2 |
M. Fukushima, et al |
| author_facet |
M. Fukushima, et al Feng, Zhi Teo, Kok Rehbock, Volker |
| format |
Conference Paper |
| author |
Feng, Zhi Teo, Kok Rehbock, Volker |
| spellingShingle |
Feng, Zhi Teo, Kok Rehbock, Volker A Smoothing Approach for Semi-infinite Programming with Projected Newton-type Algorithm |
| author_sort |
Feng, Zhi |
| title |
A Smoothing Approach for Semi-infinite Programming with Projected Newton-type Algorithm |
| title_short |
A Smoothing Approach for Semi-infinite Programming with Projected Newton-type Algorithm |
| title_full |
A Smoothing Approach for Semi-infinite Programming with Projected Newton-type Algorithm |
| title_fullStr |
A Smoothing Approach for Semi-infinite Programming with Projected Newton-type Algorithm |
| title_full_unstemmed |
A Smoothing Approach for Semi-infinite Programming with Projected Newton-type Algorithm |
| title_sort |
smoothing approach for semi-infinite programming with projected newton-type algorithm |
| publisher |
Universal Academy Press, Inc |
| publishDate |
2007 |
| url |
http://hdl.handle.net/20.500.11937/40355 |
| first_indexed |
2018-09-06T23:02:30Z |
| last_indexed |
2018-09-06T23:02:30Z |
| _version_ |
1610901042417893376 |