A new QP-free algorithm for inequality constrained optimization without strict complementarity

MaRDI QIDQ2859832zbMATH OpenFDO

Authors Congying Han, Mingqiang Li, Yongli Wang, Tian Li

Publication date 19 November 2013

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

zbMATH Keywords

generalized projection gradientglobal convergenceinequality constrained optimizationQP-free methodsuperlinear convergence

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A new constraints identification technique-based QP-free algorithm for the solution of inequality constrained minimization problems.
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
• A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
• A new globally and superlinearly convergent QP-free method for inequality constrained optimization
• An improved feasible QP-free algorithm for inequality constrained optimization

Cited in

(9)

• An improved feasible QP-free algorithm for inequality constrained optimization
• A globally convergent QP-free algorithm for inequality constrained minimax optimization
• A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints
• A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization
• A new QP-free, globally convergent, locally superlinearly convergent algorithm for inequality constrained optimization
• An SQCQP algorithm with new active identification set for inequality constrained optimization
• A new constraints identification technique-based QP-free algorithm for the solution of inequality constrained minimization problems.
• A QP-free algorithm with weaker strict complementarity condition
• A QP-free and superlinearly convergent algorithm for inequality constrained optimizations

This page was built for publication: A new QP-free algorithm for inequality constrained optimization without strict complementarity

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