Analysis of Inexact Trust-Region SQP Algorithms

• Autor(a) principal: Heinkenschloss, Matthias
• Data de Publicação: 2002
• Outros Autores: Vicente, Luís N.
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10316/13416; https://doi.org/10.1137/s1052623499361543
• topic: Nonlinear programming; Trust–region methods; Inexact linear systems solvers; Krylov subspace methods; Optimal control

In this paper we extend the design of a class of composite–step trust–region SQP methods and their global convergence analysis to 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. Our accuracy requirements are stated in general terms, but we show how they can be enforced using information that is already available in matrix–free implementations of SQP methods. In the absence of inexactness our global convergence theory is equal to that of Dennis, El–Alem, Maciel (SIAM J. Optim., 7 (1997), pp. 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