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...
Main Author: | V.Moraru |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
1996-03-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v3-n3/v3-n3-(pp263-277).pdf |
Similar Items
-
A Smooth Newton Method for Nonlinear Programming Problems with Inequality Constraints
by: Vasile Moraru
Published: (2012-02-01) -
A Sparse Quasi-Newton Method Based on Automatic Differentiation for Solving Unconstrained Optimization Problems
by: Huiping Cao, et al.
Published: (2021-11-01) -
On a Nonsmooth Gauss–Newton Algorithms for Solving Nonlinear Complementarity Problems
by: Marek J. Śmietański
Published: (2020-08-01) -
On the Convergence Rate of Quasi-Newton Methods on Strongly Convex Functions with Lipschitz Gradient
by: Vladimir Krutikov, et al.
Published: (2023-11-01) -
An active-set memoryless quasi-Newton method based on a spectral-scaling Broyden family for bound constrained optimization
by: Shummin Nakayama, et al.
Published: (2021-06-01)