On an inexact trust-region SQP-filter method for constrained nonlinear optimization
From MaRDI portal
Publication:263150
DOI10.1007/s10589-015-9793-xzbMath1362.90344OpenAlexW2144531113MaRDI QIDQ263150
Andrea Walther, Lorenz T. Biegler
Publication date: 4 April 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9793-x
Related Items
Discrete time-variant nonlinear optimization and system solving via integral-type error function and twice ZND formula with noises suppressed, Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds, A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization, 1 Model reduction in chemical process optimization
Uses Software
Cites Work
- Unnamed Item
- An inexact Newton method for nonconvex equality constrained optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A first-order convergence analysis of trust-region methods with inexact Jacobians and inequality constraints
- A Matrix-Free Trust-Region SQP Method for Equality Constrained Optimization
- Adaptive Multilevel Inexact SQP Methods for PDE-Constrained Optimization
- Evaluating Derivatives
- On constrained optimization by adjoint based quasi-Newton methods
- Trust Region Methods
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
- An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
- A trust region method based on interior point techniques for nonlinear programming.
