An SQP algorithm with trust region for nonlinear constrained optimization
From MaRDI portal
Publication:5455048
zbMATH Open1194.90102MaRDI QIDQ5455048FDOQ5455048
Authors: Zhibin Zhu, Qinggan Tang, Xiaohui Yang 
Publication date: 3 April 2008
Recommendations
- scientific article; zbMATH DE number 5309864
- A superlinearly convergent trust region-SQP algorithm for inequality constrained optimization
- A trust region algorithm for optimization with nonlinear equality and linear inequality constraints
- A trust region algorithm for solving nonlinear inequality constrained optimization
- scientific article; zbMATH DE number 1070349
Cited In (14)
- On an inexact trust-region SQP-filter method for constrained nonlinear optimization
- A Feasible Trust-Region Sequential Quadratic Programming Algorithm
- An Inexact Trust-Region SQP Method with Applications to PDE-Constrained Optimization
- Analysis of inexact trust-region SQP algorithms
- Augmented Lagrangian nonlinear programming algorithm that uses SQP and trust region techniques
- A superlinearly convergent trust region-SQP algorithm for inequality constrained optimization
- GLOBAL CONVERGENCE OF A TRUST REGION SEQUENTIAL QUADRATIC PROGRAMMING METHOD
- On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization
- Title not available (Why is that?)
- Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
- A trust-region SQP method without a penalty or a filter for nonlinear programming
- A trust region algorithm for equality constrained optimization
- A trust region SQP algorithm for equality constrained parameter estimation with simple parameter bounds
- Mixed trust region algorithm based on Cholesky resolving
This page was built for publication: An SQP algorithm with trust region for nonlinear constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5455048)
