A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity

From MaRDI portal
Publication:833162

DOI10.1016/j.amc.2009.04.022zbMath1180.65077OpenAlexW2011775228MaRDI QIDQ833162

Xiao-Yan Ke, Wei-Xin Cheng, Jin-Bao Jian

Publication date: 12 August 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.04.022




Related Items (3)


Uses Software


Cites Work


This page was built for publication: A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity