An SQCQP algorithm with new active identification set for inequality constrained optimization

MaRDI QIDQ3194374zbMATH OpenFDO

Authors Meixing Liu, Chun-Ming Tang, Jinbao Jian

Publication date 28 October 2015

zbMATH Keywords

global convergenceinequality constrained optimizationsequential quadratically constrained quadratic programmingactive identification set

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30)

Recommendations

• A working set SQCQP algorithm with simple nonmonotone penalty parameters
• A sequential equality constrained quadratic programming algorithm for inequality constrained optimization
• A new QP-free algorithm for inequality constrained optimization without strict complementarity
• Global convergence on an active set SQP for inequality constrained optimization
• A new constraints identification technique-based QP-free algorithm for the solution of inequality constrained minimization problems.

Cited in

(3)

• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
• A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization
• A working set SQCQP algorithm with simple nonmonotone penalty parameters

This page was built for publication: An SQCQP algorithm with new active identification set for inequality constrained optimization

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