A QP-free feasible method with slack NCP function

zbMATH Open1174.90851MaRDI QIDQ3611202FDOQ3611202

Shenghua Gui, Yan Zhou

Publication date: 6 March 2009

Recommendations

• A QP-free method for nonlinear programming problems
• scientific article; zbMATH DE number 2112990
• A kind of QP-free feasible method
• Piecewise linear NCP function for QP free feasible method
• A modified QP-free feasible method

zbMATH Keywords

constrained optimizationsuperlinear convergenceKKT pointslack nonlinear complementarity problem function

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (1)

• Feasible interior methods using slacks for nonlinear optimization

This page was built for publication: A QP-free feasible method with slack NCP function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611202)