The following publications are possibly variants of this publication:
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimizationJin-Bao Jian, Hai-Yan Zheng, Chun-ming Tang, Qing-Jie Hu. amc, 182(2):955-976, 2006. [doi]
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problemsJin-Bao Jian, Jie Li, Hai-Yan Zheng, Jian-Ling Li. amc, 226:673-690, 2014. [doi]
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraintsJin-Bao Jian, Qing-Juan Xu, Dao-Lan Han. amc, 182(1):854-870, 2006. [doi]
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimizationJinbao Jian, Haiyan Zheng, Qingjie Hu, Chunming Tang. amc, 168(1):1-28, 2005. [doi]
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarityJin-Bao Jian. amc, 162(3):1065-1081, 2005. [doi]
- Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax ProblemsJin-Bao Jian, Qing-Juan Hu, Chun-ming Tang. jota, 163(3):859-883, 2014. [doi]
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimizationJin-Bao Jian, You-Fang Zeng, Chun-ming Tang. cma, 54(4):507-524, 2007. [doi]
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarityJinbao Jian, Dao-Lan Han, Qing-Juan Xu. amc, 236:93-108, 2014. [doi]
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequencesJin-Bao Jian, Qiao-fang Chen, Zong-wen Huang. jcam, 263:115-128, 2014. [doi]