Quasi-Newton Methods for Solving Nonlinear Programming Problems
In the present paper the problem of constrained equality optimization is reduced to sequential solving a series of problems of quadratic programming. The Hessian of the Lagrangian is approximated by a sequence of symmetric positive definite matrices. The matrix approximation is updated at every iter...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
1996-03-01
|
| Edice: | Computer Science Journal of Moldova |
| Témata: | |
| On-line přístup: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v3-n3/v3-n3-(pp263-277).pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|