ISSN:
1436-4646
Keywords:
Sequential quadratic programming
;
parameter identification
;
65K10
;
65H10
;
49D37
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract We analyze the method of sequential quadratic programming for equality constrained minimization problems in Hilbert spaces of functions, and for the discrete approximations of such problems in the context of an elliptic parameter identification problem. We show how the discretization can be constructed so as to preserve the convergence behavior of the iterates for the infinite dimensional problem in the finite dimensional approximations. We use the structure of the parameter identification problem to reduce the size of the linear system for the SQP step and verify nondegeneracy of the constraints.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01586941
Permalink
