\`x^2+y_1+z_12^34\`
Advanced Search
Advanced Search
Advanced Search
This issue Previous Article Next Article
Article Contents
Article Contents
2005, Volume 1, Issue 2: 235-250. Doi: 10.3934/jimo.2005.1.235
This issue Previous Article A discretization based smoothing method for solving semi-infinite variational inequalities Next Article A network simplex algorithm for simple manufacturing network model

A smoothing projected Newton-type method for semismooth equations with bound constraints

  • 1.

    Institute of Mathematics, Changsha University of Science and Technology, Changsha

  • 2.

    Institute of Applied Mathematics, Hunan University, Changsha

Received:  May 31, 2004
Revised:  November 30, 2005
Published:  March 2005
Abstract Related Papers Cited by
    Abstract
  • This paper develops a smoothing algorithm to solve a system of constrained equations. Compared with the traditional methods, the new method does not need the continuous differentiability assumption for the corresponding merit function. By using some perturbing technique and suitable strategy of the chosen search direction, we find that the new method not only keeps the strict positivity of the smoothing variable at any non-stationary point of the corresponding optimization problem, but also enjoys global convergence and locally superliner convergence. The former character is the key requirement for smoothing methods. Some numerical examples arising from semi-infinite programming (SIP) show that the new algorithm is promising.
    Mathematics Subject Classification: 90C33, 90C30, 65H10.

    Citation:
    shu

    \begin{equation} \\ \end{equation}
    • Related Papers
  • Cited by
  • Access History
  • 加载中
PDF
XML
Export Citation
SHARE
Email to a Friend

Article Metrics

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

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    Site map Copyright © 2023 American Institute of Mathematical Sciences