A QP-free algorithm with weaker strict complementarity condition

zbMATH Open1174.90859MaRDI QIDQ5456435FDOQ5456435

Authors Haodong Yu, Shenghua Gui, Dingguo Pu 

Publication date 4 April 2008

zbMATH Keywords

superlinear convergencestrict complementarity conditionQP-free method

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2112990
• A QP-free method for nonlinear programming problems
• A new QP-free algorithm for inequality constrained optimization without strict complementarity
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
• Convergence of QP-free infeasible methods for nonlinear inequality constrained optimization problems

This page was built for publication: A QP-free algorithm with weaker strict complementarity condition

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