A perturbed strongly sub-feasible sequential quadratic programming algorithm

MaRDI QIDQ3017474zbMATH OpenFDO

Authors Shujun Bi, Chun-Ming Tang

Publication date 19 July 2011

zbMATH Keywords

global convergenceperturbation parametersequential quadratic programmingstrongly sub-feasiblesuperlinear convergence

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
• A modified strongly sub-feasible SQCQP algorithm
• A Feasible Trust-Region Sequential Quadratic Programming Algorithm
• A modified strongly sub-feasible SQP algorithm for constrained optimization and numerical experiments
• scientific article; zbMATH DE number 4158404

Cited in

(5)

• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
• Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework
• A modified strongly sub-feasible SQCQP algorithm
• A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem
• A robust implementation of a sequential quadratic programming algorithm with successive error restoration

This page was built for publication: A perturbed strongly sub-feasible sequential quadratic programming algorithm

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