scientific article; zbMATH DE number 938975

zbMATH Open0858.90118MaRDI QIDQ4897149FDOQ4897149

Authors: Fang Wu, Ziyou Gao 

Publication date: 23 March 1997

Title of this publication is not available (Why is that?)

Recommendations

• A feasible SQP method for nonlinear programming
• scientific article; zbMATH DE number 1159542
• scientific article; zbMATH DE number 851560
• A new SQP method of feasible directions for nonlinear programming.

zbMATH Keywords

global convergencelocal superlinear convergenceSQP feasible method

Mathematics Subject Classification ID

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

Cited In (9)

• Infeasibility Detection and SQP Methods for Nonlinear Optimization
• A feasible SQP method for nonlinear programming
• A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity
• Title not available (Why is that?)
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
• A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems
• A quadratically approximate framework for constrained optimization, global and local convergence

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 Q4897149)