full
search.png

Search

close.png

Cancel

arrow
Volume 7, Issue 3
A Globally Convergent Method of Constrained Minimization by Solving Subproblems of the Conic Model

Ling-Ping Sun

J. Comp. Math., 7 (1989), pp. 234-243.

Published online: 1989-07

Preview Full PDF 2499 25758

Cited by

google scholar semantic scholar
Export citation
  • Abstract

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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-7-234, author = {Sun , Ling-Ping}, title = {A Globally Convergent Method of Constrained Minimization by Solving Subproblems of the Conic Model}, journal = {Journal of Computational Mathematics}, year = {1989}, volume = {7}, number = {3}, pages = {234--243}, abstract = {

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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9474.html} }
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 -

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.

Sun , Ling-Ping. (1989). A Globally Convergent Method of Constrained Minimization by Solving Subproblems of the Conic Model. Journal of Computational Mathematics. 7 (3). 234-243. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard