Heinkenschloss, MatthiasVicente, Luis N.2018-06-182018-06-181999-09Heinkenschloss, Matthias and Vicente, Luis N.. "Analysis of Inexact Trust-Region SQP Algorithms." (1999) <a href="https://hdl.handle.net/1911/101923">https://hdl.handle.net/1911/101923</a>.https://hdl.handle.net/1911/101923In this paper we study the global convergence behavior of a class of composite-step trust-region SQP methods that allow inexact problem information. The inexact problem information can result from iterative linear systems solves within the trust-region SQP method or from approximations of first-order derivatives. Accuracy requirements in our trust-region SQP methods are adjusted based on feasibility and optimality of the iterates. In the absence of inexactness our global convergence theory is equal to that of Dennis, El-Alem, Maciel (SIAM J. Optim. 7 (1997), 177-207). If all iterates are feasible, i.e., if all iterates satisfy the equality constraints, then our results are related to the known convergence analyses for trust-region methods with inexact gradient information for unconstrained optimization.17 ppengTechnical reportTR99-18