J. F. Bonnans, J. Ch, C. Gilbert, C. Lemaréchal, and . Sagastizábal, Numerical Optimization ? Theoretical and Practical Aspects (second edition). Universitext, p.18, 2006.

W. Cheng, Q. Liu, and D. Li, An accurate active set conjugate gradient algorithm with project search for bound constrained optimization. Optimization Letters, pp.763-776, 2014.

A. Chiche, J. Ch, and . Gilbert, How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem, Journal of Convex Analysis, p.34, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01057577

F. Delbos, J. Ch, and . Gilbert, Global linear convergence of an augmented Lagrangian algorithm for solving convex quadratic optimization problems, Journal of Convex Analysis, vol.12, issue.9, pp.45-69, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00071556

M. Domorádová, Projector preconditioning for patially bound-constrained quadratic optimization. Numerical Linear Algebra with Applications, Z. Dostál, vol.14, pp.791-806, 2007.

Z. Dostál, M. Domorádová, and M. Sadowská, Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints, Computational Optimization and Applications, vol.48, issue.4, pp.23-44, 2011.
DOI : 10.1007/s10589-009-9237-6

Z. Dostál, A. Friedlander, and S. A. Santos, Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints, SIAM Journal on Optimization, vol.13, issue.4, pp.1120-1140, 2003.
DOI : 10.1137/S1052623499362573

D. Du and X. Zhang, Global convergence of Rosen's gradient projection method, Mathematical Programming, pp.357-366, 1989.
DOI : 10.1007/BF01587098

J. Ch and . Gilbert, Éléments d'Optimisation Différentiable ? Théorie et Algorithmes. Syllabus de cours à l'ENSTA, p.34, 2013.

J. Ch, É. Gilbert, and . Joannopoulos, OQLA/QPALM -Convex quadratic optimization solvers using the augmented Lagrangian approach, with an appropriate behavior on infeasible or unbounded problems, 2015.

A. Greenbaum, V. Pták, and Z. Strako?, Any Nonincreasing Convergence Curve is Possible for GMRES, SIAM Journal on Matrix Analysis and Applications, vol.17, issue.3, pp.465-469, 1996.
DOI : 10.1137/S0895479894275030

S. Hammarling, N. J. Higham, and C. Lucas, LAPACK-Style Codes for Pivoted Cholesky and QR Updating, Applied Parallel Computing -State of the Art in Scientific Computing, pp.137-146, 2007.
DOI : 10.1007/978-3-540-75755-9_17

N. J. Higham, Accuracy and Stability of Numerical Algorithms (second edition), p.33, 2002.

N. J. Higham, Cholesky factorization, Wiley Interdisciplinary Reviews: Computational Statistics, vol.103, issue.2, p.32, 2008.
DOI : 10.1002/wics.18

J. Hiriart-urruty and C. , Convex Analysis and Minimization Algorithms. Grundlehren der mathematischen Wissenschaften 305-306, p.16, 1993.

C. Lucas, LAPACK-style codes for level 2 and 3 pivoted Cholesky factorizations, p.30, 2004.

C. Lucas, Algorithms for Cholesky and QR Factorizations, and the Semidefinite Generalized Eigenvalue Problem, p.30, 2004.

J. J. Moré and G. Toraldo, Algorithms for bound constrained quadratic programming problems, Numerische Mathematik, vol.34, issue.4, pp.377-400, 1989.
DOI : 10.1007/BF01396045

J. J. Moré and G. Toraldo, On the Solution of Large Quadratic Programming Problems with Bound Constraints, SIAM Journal on Optimization, vol.1, issue.1, pp.93-113, 1991.
DOI : 10.1137/0801008

J. Nocedal and S. J. Wright, Numerical Optimization (second edition) Springer Series in Operations Research, p.33, 2006.

J. B. Rosen, The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints, Journal of the Society for Industrial and Applied Mathematics, vol.8, issue.1, pp.181-217, 1960.
DOI : 10.1137/0108011