On an inexact trust-region SQP-filter method for constrained nonlinear optimization
Andrea Walther () and
Lorenz Biegler ()
Computational Optimization and Applications, 2016, vol. 63, issue 3, 613-638
Abstract:
A class of trust-region algorithms is developed and analyzed for the solution of optimization problems with nonlinear equality and inequality constraints. These algorithms are developed for problem classes where the constraints are not available in an open, equation-based form, and constraint Jacobians are of high dimension and are expensive to calculate. Based on composite-step trust region methods and a filter approach, the resulting algorithms do not require the computation of exact Jacobians; only Jacobian vector products are used along with approximate Jacobian matrices. With these modifications, we show that the algorithm is globally convergent. Also, as demonstrated on numerical examples, our algorithm avoids direct computation of exact Jacobians and has significant potential benefits on problems where Jacobian calculations are expensive. Copyright Springer Science+Business Media New York 2016
Keywords: Inexact trust region methods; Filter approach; General constrained nonlinear optimization (search for similar items in EconPapers)
Date: 2016
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-015-9793-x (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:63:y:2016:i:3:p:613-638
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-015-9793-x
Access Statistics for this article
Computational Optimization and Applications is currently edited by William W. Hager
More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().