A new globally and superlinearly convergent QP-free method for inequality constrained optimization

zbMATH Open1174.90820MaRDI QIDQ5320133FDOQ5320133

Ke Su

Publication date: 22 July 2009

Recommendations

• 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
• A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
• An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
• An improved feasible QP-free algorithm for inequality constrained optimization

zbMATH Keywords

constrained optimizationglobal convergencenonlinear complementarity

Mathematics Subject Classification ID

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

Cited In (5)

• 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 QP-free and superlinearly convergent algorithm for inequality constrained optimizations
• A QP-free constrained Newton-type method for variational inequality problems
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization

This page was built for publication: A new globally and superlinearly convergent QP-free method for inequality constrained optimization

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