References
- T. F. Coleman. Large sparse numerical optimization. Springer-Verlag, Berlin. 1984.
- Boland N L. A dual-active-set algorithm for positive semi-definite quadratic programming. Mathematical Programming, Vol.78(1), 1997, pp.1–27. doi: 10.1007/BF02614503
- A. N. Daryina, A. F. Izmailov. On active-set methods for the quadratic programming problem. Computational Mathematics and Mathematical Physics, Vol.52(4), 2012, pp.512–523. doi: 10.1134/S0965542512040070
- Ruian Zhao, Fang Wu. Nonlinear optimization theory and methods, Zhejiang science and technology press, Zhejiang. 1992.
- Yaxiang Yuan. Nonlinear optimization method. Science press, Beijing. 2008.
- Kou Shu-shun. Algorithm for finding all solutions of lcp-integer sets method. Journal of tianjin university, Vol.34(5), 2001,pp.582–593.
- Angelo Lucia. Successive Quadratic Programming: Decomposition Methods. Encyclopedia of Optimization, Vol.7, 2009, pp.3866–3871. doi: 10.1007/978-0-387-74759-0_674
- Philip E. Gill, Elizabeth Wong. Sequential Quadratic Programming Methods. The IMA Volumes in Mathematics and its Applications. Vol.154, 2012, pp.147–224. doi: 10.1007/978-1-4614-1927-3_6
- Wenkang Cai, Jiajun Mao. Polyhedron on quadratic programming and the simplex algorithm. Shanghai electric power college journal, Vol.18(2), 2002, pp.55–58.
- Yang Mingsheng, Luo Changtong. The optimization principle, method and solving software. Science press, Beijing. 2006.