A nonmonotone SQP method for nonlinear programming without a penalty function
From MaRDI portal
Recommendations
- A modified nonmonotone SQP method
- On the local convergence of a penalty-function-free SQP method
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- Nonlinear programming without a penalty function.
- A penalty-function-free line search SQP method for nonlinear programming
Cited in
(10)- An SQP method based on a 3-piecewise linear NCP function without using penalty function and filter
- On the local convergence of a penalty-function-free SQP method
- An infeasible nonmonotone SSLE algorithm for nonlinear programming
- Sequential penalty algorithm for nonlinear constrained optimization
- A sequential quadratic programming technique with two-parameter penalty-function
- Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization
- A new penalty method for nonlinear programming
- A working set SQCQP algorithm with simple nonmonotone penalty parameters
- scientific article; zbMATH DE number 151663 (Why is no real title available?)
- Inexact sequential quadratic optimization with penalty parameter updates within the QP solver
This page was built for publication: A nonmonotone SQP method for nonlinear programming without a penalty function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4926859)
