A modified nonmonotone SQP method
From MaRDI portal
Recommendations
- A modified SQP method with nonmonotone line search technique without a penalty or a filter for nonlinear inequality constrained optimization
- Global convergence of a modified nonmonotone QP-free method without penalty function or filter
- A modified SQP method with nonmonotone technique and its global convergence
- A modified SQP-filter method
- A SQP method based on a modified penalty function for nonlinear inequality constrained optimization problem
Cited in
(12)- A modified SQP method with nonmonotone technique and its global convergence
- A modified SQP method with nonmonotone line search technique without a penalty or a filter for nonlinear inequality constrained optimization
- A modified limited SQP method for constrained optimization
- An SQP method with a revised non-monotone line search
- A modified SQP-filter method
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- A nonmonotone SQP method for nonlinear programming without a penalty function
- On the local convergence of a penalty-function-free SQP method
- Global convergence of a modified nonmonotone QP-free method without penalty function or filter
- A SQP method based on a modified penalty function for nonlinear inequality constrained optimization problem
- A modified SQP method and its global convergence
- A modified SQP method with nonmonotone linesearch technique.
This page was built for publication: A modified nonmonotone SQP method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910593)