scientific article; zbMATH DE number 5926248

DOI10.3969/J.ISSN.0253-374X.2010.02.028MaRDI QIDQ3014469zbMATH OpenFDO

Authors Dingguo Pu, Zhong Jin

Publication date 19 July 2011

Full work available at URL https://doi.org/10.3969/J.ISSN.0253-374X.2010.02.028

zbMATH Keywords

convergencenonlinear complementarity functionQP-free method

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A kind of nonmonotone QP-free method for constrained optimization
• A QP-free method for nonlinear programming problems
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
• An SQP method with a revised non-monotone line search
• A new nonmonotone line search technique for unconstrained optimization
• A new nonmonotone line search technique for unconstrained optimization
• An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
• A QP-free infeasible method with filter for nonlinear programming problems

Cited in

(1)

• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints

This page was built for publication:

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