A Globally Convergent Algorithm for Nonlinear Programming
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

O221.2

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    A new globally convergent algorithm was presented for a continuous differen-tiable nonlinear programming by defining a measure function deviating from the Kuhn-Tucker point. With this algorithm which can be used to get the optimum solution of the problem,the optimal lagrangian multiplier corresponding the optimal solution of the problem was also obtained. A new iterative algorithm for quadratic programming is obtained when applying the general algorithm to quadratic programming. Finally,a numerical example was given.

    Reference
    Related
    Cited by
Get Citation

赵云彬 段虞荣.非线性规划的一种全局收敛算法[J].重庆大学学报,1993,16(5):125~130

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
Article QR Code