Author:
Arguello Henry,Marquez Miguel
Publisher
Springer International Publishing
Reference73 articles.
1. S. Boyd and L. Vandenberghe, Convex optimization, Cambridge: Cambridge university press, 2004.
2. A. Dempster, N. Laird and D. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Journal of the Royal Statistical Society: Series B (Methodological), vol. 39, no. 1, pp. 1–22, 1977.
3. D. Goldfarb and A. U. Idnani, “A numerically stable dual method for solving strictly convex quadratic programs,” Mathematical Programming, vol. 27, pp. 1–33, 1983.
4. M. P. Friedlander and D. Orban, “A primal-dual regularized interior-point method for convex quadratic programs,” Mathematical Programming Computation, vol. 4, pp. 71–107, 2012.
5. P. Gill and E. Wong, “Methods for convex and general quadratic programming,” Mathematical programming computation, vol. 7, no. 1, pp. 71–112, 2015.