Advanced Search
Article Contents
Article Contents

A smoothing approach for semi-infinite programming with projected Newton-type algorithm

Abstract Related Papers Cited by
  • 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.
    Mathematics Subject Classification: Primary: 90C34; Secondary: 90C5.


    \begin{equation} \\ \end{equation}
  • 加载中

Article Metrics

HTML views() PDF downloads(83) Cited by(0)

Access History

Other Articles By Authors



    DownLoad:  Full-Size Img  PowerPoint