A QP-free method for nonlinear programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2112990
- Piecewise linear NCP function for QP free feasible method
- Convergence of QP-free infeasible methods for nonlinear inequality constrained optimization problems
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- A nonmonotone QP-free method without a penalty function and a filter
Cited in
(14)- A kind of QP-free feasible method
- A globally and superlinearly convergent feasible QP-free method for nonlinear programming
- scientific article; zbMATH DE number 5926248 (Why is no real title available?)
- scientific article; zbMATH DE number 3848110 (Why is no real title available?)
- Convergence of QP-free infeasible methods for nonlinear inequality constrained optimization problems
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- A QP-free feasible method with slack NCP function
- QP-free method for variational inequality problems
- scientific article; zbMATH DE number 16628 (Why is no real title available?)
- scientific article; zbMATH DE number 1174443 (Why is no real title available?)
- scientific article; zbMATH DE number 2112990 (Why is no real title available?)
- A QP-free algorithm with weaker strict complementarity condition
- Local feasible QP-free algorithms for the constrained minimization of SC^1 functions
- Piecewise linear NCP function for QP free feasible method
This page was built for publication: A QP-free method for nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109668)
