M. Aganagi?, Newton's method for linear complementarity problems, Mathematical Programming, pp.349-362, 1984.
DOI : 10.1007/BF02612339

K. J. Arrow, F. J. Gould, and S. M. Howe, A generalized saddle point result for constrained optimization, Mathematical Programming, pp.225-234, 1973.

. Ch, D. Audet, and . Orban, Finding optimal algorithmic parameters using derivative-free optimization, SIAM Journal on Optimization, vol.17, pp.642-664, 2006.

I. B. Gharbia, J. Ch, and . Gilbert, Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix, Mathematical Programming, pp.349-364, 2012.
DOI : 10.1007/s10107-010-0439-6
URL : https://hal.archives-ouvertes.fr/inria-00442293

I. B. Gharbia, J. Ch, and . Gilbert, An Algorithmic Characterization of $P$-Matricity, SIAM Journal on Matrix Analysis and Applications, vol.34, issue.3, pp.904-916, 2013.
DOI : 10.1137/120883025
URL : https://hal.archives-ouvertes.fr/hal-00713330

E. G. Birgin and J. M. Martínez, Practical Augmented Lagrangian Methods for Constrained Optimization, p.10, 2014.
DOI : 10.1137/1.9781611973365

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

J. D. Buys, Dual algorithms for constrained optimization, 1972.

R. H. Byrd, J. Ch, and J. Gilbert, A trust region method based on interior point techniques for nonlinear programming, Mathematical Programming, pp.149-185, 2000.
DOI : 10.1007/PL00011391
URL : https://hal.archives-ouvertes.fr/inria-00073794

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

A. R. Conn, N. I. Gould, and P. L. Toint, LANCELOT: A Fortran Package for Large- Scale Nonlinear Optimization (Release A), Computational Mathematics, vol.17, issue.6, 1992.
DOI : 10.1007/978-3-662-12211-2

F. E. Curtis, Z. Han, and D. P. Robinson, A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization, Computational Optimization and Applications, vol.80, issue.389, 2014.
DOI : 10.1007/s10589-014-9681-9

E. J. Dean and R. Glowinski, An augmented Lagrangian approach to the numerical solution of the Dirichlet problem for the elliptic Monge-Ampère equation in two dimensions, Electronic Transactions on Numerical Analysis, vol.22, issue.6, pp.71-96, 2006.

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.6 9, pp.45-69, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00071556

E. D. Dolan, J. J. Moré, and T. S. Munson, Optimality Measures for Performance Profiles, SIAM Journal on Optimization, vol.16, issue.3, pp.891-909, 2006.
DOI : 10.1137/040608015
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.179

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.37-53, 1999.
DOI : 10.1137/S1052623499362573

Z. Dostál, A. Friedlander, S. A. Santos, and K. Alesawi, Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints: corrigendum and addendum, Computational Optimization and Applications, vol.23, issue.1, pp.127-133, 2000.
DOI : 10.1023/A:1019980809734

M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.95-110, 1956.
DOI : 10.1002/nav.3800030109

M. Friedlander and S. Leyffer, Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs, SIAM Journal on Scientific Computing, vol.30, issue.4, pp.1706-1726, 2008.
DOI : 10.1137/060669930

E. M. Gertz and S. Wright, Object-oriented software for quadratic programming, ACM Transactions on Mathematical Software, vol.29, issue.1, pp.58-81, 2003.
DOI : 10.1145/641876.641880
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.9532

J. Ch, É. Gilbert, and . Joannopoulos, Inside OQLA and QPALM, p.14, 2014.

J. Ch and C. Gilbert, Some numerical experiments with variable-storage quasi- Newton algorithms, Mathematical Programming, pp.407-435, 1989.

P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, 1981.

N. I. Gould, D. Orban, and P. L. Toint, GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization, ACM Transactions on Mathematical Software, vol.29, issue.4, 2003.
DOI : 10.1145/962437.962438

N. I. Gould, D. Orban, and P. L. Toint, Cutest: a constrained and unconstrained testing environment with safe threads, 2013.

O. Güler, Augmented Lagrangian algorithms for linear programming, Journal of Optimization Theory and Applications, vol.9, issue.3, pp.445-470, 1992.
DOI : 10.1007/BF00940486

D. Henrion and J. Malick, Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions. Optimization Methods and Software, pp.23-46, 2009.

M. R. Hestenes, Multiplier and gradient methods, Journal of Optimization Theory and Applications, vol.4, issue.5, pp.303-320, 1969.
DOI : 10.1007/BF00927673

J. Hiriart-urruty and C. , Convex Analysis and Minimization Algorithms. Grundlehren der mathematischen Wissenschaften 305-306, p.13, 1993.
DOI : 10.1007/978-3-662-02796-7

K. Ito and K. Kunisch, Lagrange Multiplier Approach to Variational Problems and Applications, 2008.
DOI : 10.1137/1.9780898718614

A. F. Izmailov and M. V. Solodov, Newton-Type Methods for Optimization and Variational Problems, Series in Operations Research and Financial Engineering, 2014.
DOI : 10.1007/978-3-319-04247-3

D. C. Liu and J. , On the limited memory BFGS method for large scale optimization, Mathematical Programming, pp.503-520, 1989.
DOI : 10.1007/BF01589116

J. Malick, A Dual Approach to Semidefinite Least-Squares Problems, SIAM Journal on Matrix Analysis and Applications, vol.26, issue.1, pp.272-284, 2004.
DOI : 10.1137/S0895479802413856
URL : https://hal.archives-ouvertes.fr/inria-00072409

J. Malick, J. Povh, F. Rendl, and A. Wiegele, Regularization Methods for Semidefinite Programming, SIAM Journal on Optimization, vol.20, issue.1, pp.336-356, 2009.
DOI : 10.1137/070704575
URL : https://hal.archives-ouvertes.fr/hal-00389552

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. Moreau, Proximit?? et dualit?? dans un espace hilbertien, Bulletin de la Société mathématique de France, vol.79, issue.5, pp.273-299, 1965.
DOI : 10.24033/bsmf.1625
URL : http://archive.numdam.org/article/BSMF_1965__93__273_0.pdf

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

B. T. Poljak and N. V. Tret-'jakov, A certain iteration method of linear programming and its economic interpretationin russian, Èkonomika i Matematicheskie Metody, vol.8, pp.740-751, 1972.

M. J. Powell, A method for nonlinear constraints in minimization problems, Optimization, pp.283-298, 1969.

R. T. Rockafellar, New applications of duality in convex programming, Proceedings of the 4th Conference of Probability, pp.73-81, 1971.

R. T. Rockafellar, A dual approach to solving nonlinear programming problems by unconstrained optimization, Mathematical Programming, pp.354-373, 1973.
DOI : 10.1007/BF01580138

R. T. Rockafellar, The multiplier method of Hestenes and Powell applied to convex programming, Journal of Optimization Theory and Applications, vol.8, issue.6, pp.555-562, 1973.
DOI : 10.1007/BF00934777

R. T. Rockafellar, Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming, SIAM Journal on Control, vol.12, issue.2, pp.268-285, 1974.
DOI : 10.1137/0312021

A. Shapiro and J. Sun, Some Properties of the Augmented Lagrangian in Cone Constrained Optimization, Mathematics of Operations Research, vol.29, issue.3, pp.479-491, 2004.
DOI : 10.1287/moor.1040.0103

M. Ulbrich, Semismooth Newton Methods for Variational Inequalities and Constrained Optimization Problems in Function Spaces, MPS-SIAM Series on Optimization, vol.11, issue.2, 2011.
DOI : 10.1137/1.9781611970692

Z. Wen, D. Goldfarb, and W. Yin, Alternating direction augmented Lagrangian methods for semidefinite programming, Mathematical Programming Computation, vol.20, issue.3-4, pp.203-230, 2010.
DOI : 10.1007/s12532-010-0017-1

S. J. Wright, Primal-Dual Interior-Point Methods, 1997.
DOI : 10.1137/1.9781611971453
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.5633