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

A. Auslender and M. Teboulle, Asymptotic Cones and Functions in Optimization and Variational Inequalitites, 2003.

J. F. Bonnans, J. Ch, C. Gilbert, C. Lemaréchal, and . Sagastizábal, A family of variable metric proximal methods, Mathematical Programming, pp.15-47, 1995.
DOI : 10.1007/BF01585756
URL : https://hal.archives-ouvertes.fr/inria-00074821

J. F. Bonnans, J. Ch, C. Gilbert, C. Lemaréchal, and . Sagastizábal, Numerical Optimization ? Theoretical and Practical Aspects, 2006.

J. M. Borwein and A. S. Lewis, Convex Analysis and Nonlinear Optimization, 2000.

R. E. Bruck and S. Reich, Nonexpansive projections and resolvents of accretive operators in Banach spaces, Houston Journal of Mathematics, vol.3, issue.20, pp.459-470, 1977.

J. V. Burke, A sequential quadratic programming method for potentially infeasible mathematical programs, Journal of Mathematical Analysis and Applications, vol.139, issue.2, pp.319-351, 1989.
DOI : 10.1016/0022-247X(89)90111-X

J. V. Burke, A Robust Trust Region Method for Constrained Nonlinear Programming Problems, SIAM Journal on Optimization, vol.2, issue.2, pp.325-347, 1992.
DOI : 10.1137/0802016

J. V. Burke and S. Han, A robust sequential quadratic programming method, Mathematical Programming, vol.28, issue.1-3, pp.277-303, 1989.
DOI : 10.1007/BF01582294

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

R. H. Byrd, Robust trust region methods for constrained optimization, Third SIAM Conference on Optimization, p.27, 1987.

R. H. Byrd, R. B. Schnabel, and G. A. Shultz, A Trust Region Algorithm for Nonlinearly Constrained Optimization, SIAM Journal on Numerical Analysis, vol.24, issue.5, pp.1152-1170, 1987.
DOI : 10.1137/0724076

A. R. Conn, N. I. Gould, and P. L. Toint, Trust-Region Methods, MPS-SIAM Series on Optimization 1. SIAM and MPS, p.26, 2000.
DOI : 10.1137/1.9780898719857

R. Correa and C. , Convergence of some algorithms for convex minimization, Mathematical Programming, vol.3, issue.1-3, pp.261-275, 1993.
DOI : 10.1007/BF01585170

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

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

J. Eckstein, Augmented Lagrangian and alternating direction methods for convex optimization: a tutorial and some illustrative computational results. RRR 32-2012, Department of Management Science and Information Systems (MSIS) and RUTCOR, pp.8854-8003, 2012.

J. Eckstein and P. J. Silva, Proximal methods for nonlinear programming: double regularization and inexact subproblems, Computational Optimization and Applications, vol.17, issue.3, pp.279-304, 2010.
DOI : 10.1007/s10589-009-9274-1

J. Eckstein and P. J. Silva, A practical relative error criterion for augmented Lagrangians, Mathematical Programming, vol.10, issue.3, pp.319-348, 2013.
DOI : 10.1007/s10107-012-0528-9

M. Fortin and R. Glowinski, Méthodes de Lagrangien Augmenté ? ApplicationsàApplicationsà la Résolution Numérique deProbì emes aux Limites, Méthodes Mathématiques de l'Informatique 9. Dunod, p.26, 1982.

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

J. Ch and . Gilbert, QPAL ? A solver of convex quadratic optimization problems, using an augmented Lagrangian approach ? Version 0.6.1. Rapport Technique 0377, p.23, 2009.

J. Ch, ´. E. Gilbert, and . Joannopoulos, OQLA/QPALM -Convex quadratic optimization solvers using the augmented Lagrangian approach, able to deal with infeasibility, p.26, 2014.

P. E. Gill and E. Wong, Sequential Quadratic Programming Methods, Mixed Integer Nonlinear Programming The IMA Volumes in Mathematics and its Applications, pp.147-224, 2012.
DOI : 10.1007/978-1-4614-1927-3_6

R. Glowinski and P. L. Tallec, Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics, SIAM Studies in Applied Mathematics SIAM, vol.9, issue.5, 1989.
DOI : 10.1137/1.9781611970838

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, 1993.
DOI : 10.1007/978-3-662-02796-7

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

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

E. O. Omojokun, Trust region algorithms for optimization with nonlinear equality and inequality constraints, p.27, 1991.

B. T. Poljak and N. V. Tret-'jakov, A certain iteration method of linear programming and its economic interpretation (in Russian), Ekonomika i Matematicheskie Metody, pp.740-751, 1972.

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

M. J. Powell, A fast algorithm for nonlinearly constrained optimization calculations, Lecture Notes in Mathematics, vol.3, pp.144-157, 1978.
DOI : 10.1093/comjnl/3.3.175

M. J. Powell and Y. Yuan, A trust region algorithm for equality constrained optimization, Mathematical Programming, vol.31, issue.2, pp.189-211, 1991.
DOI : 10.1007/BF01588787

S. Reich, On infinite products of resolvents, Rend. Classe Sci. Fis. Mat. e Nat. Accad. Naz. Lincei, vol.4, issue.20, p.27, 1977.

R. T. Rockafellar, Convex Analysis, Princeton Mathematics Ser, vol.28, issue.13, p.14, 1970.
DOI : 10.1515/9781400873173

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, vol.7, issue.1, 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

R. T. Rockafellar, Conjugate Duality and Optimization, Regional Conference Series in Applied Mathematics 16. SIAM, p.12, 1974.
DOI : 10.1137/1.9781611970524
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.6548

R. T. Rockafellar, Monotone Operators and the Proximal Point Algorithm, SIAM Journal on Control and Optimization, vol.14, issue.5, pp.877-898, 1976.
DOI : 10.1137/0314056

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. V. Solodov and B. F. Svaiter, A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Analysis, pp.323-345, 1999.

M. V. Solodov and B. F. Svaiter, A hybrid projection-proximal point algorithm, Journal of Convex Analysis, vol.6, pp.59-70, 1999.

M. V. Solodov and B. F. Svaiter, An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions, Mathematics of Operations Research, vol.25, issue.2, pp.214-230, 2000.
DOI : 10.1287/moor.25.2.214.12222

J. E. Spingarn, Partial inverse of a monotone operator, Applied Mathematics & Optimization, vol.1, issue.1, pp.247-265, 1983.
DOI : 10.1007/BF01448388

J. E. Spingarn, A projection method for least-squares solutions to overdetermined systems of linear inequalities, Linear Algebra and its Applications, vol.86, issue.20, pp.211-236, 1987.
DOI : 10.1016/0024-3795(87)90296-5

A. Vardi, A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation, SIAM Journal on Numerical Analysis, vol.22, issue.3, pp.575-591, 1985.
DOI : 10.1137/0722035

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.9969