TY - JOUR
T1 - A Globally Convergent Method of Constrained Minimization by Solving Subproblems of the Conic Model
AU - Sun , Ling-Ping
JO - Journal of Computational Mathematics
VL - 3
SP - 234
EP - 243
PY - 1989
DA - 1989/07
SN - 7
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/9474.html
KW - 
AB - <p style="text-align: justify;">A new method for nonlinearly constrained optimization problems is proposed. The method consists of two steps. In the first step, we get a search direction by the linearly constrained subproblems based on conic functions. In the second step, we use a differentiable penalty function, and regard it as the metric function of the problem. From this, a new approximate solution is obtained. The global convergence of the given method is also proved.</p>