P. A. Absil, R. Mahony, and B. Andrews, Convergence of the Iterates of Descent Methods for Analytic Cost Functions, SIAM Journal on Optimization, vol.16, issue.2, pp.531-547, 2005.
DOI : 10.1137/040605266

H. Attouch and J. Bolte, On the convergence of the proximal algorithm for nonsmooth functions involving analytic features, Mathematical Programming, vol.4, issue.1-2, pp.5-16, 2009.
DOI : 10.1007/s10107-007-0133-5
URL : https://hal.archives-ouvertes.fr/hal-00803898

H. Attouch, J. Bolte, P. Redont, and A. Soubeyran, Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-??ojasiewicz Inequality, Mathematics of Operations Research, vol.35, issue.2, pp.438-457, 2010.
DOI : 10.1287/moor.1100.0449

H. Attouch, J. Bolte, and B. F. Svaiter, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward???backward splitting, and regularized Gauss???Seidel methods, Mathematical Programming, pp.91-129, 2013.
DOI : 10.1007/s10107-011-0484-9
URL : https://hal.archives-ouvertes.fr/inria-00636457

A. Auslender, An Extended Sequential Quadratically Constrained Quadratic Programming Algorithm for Nonlinear, Semidefinite, and Second-Order Cone Programming, Journal of Optimization Theory and Applications, vol.117, issue.2, pp.1-30, 2013.
DOI : 10.1007/s10957-012-0145-z
URL : https://hal.archives-ouvertes.fr/hal-00965611

A. Auslender, R. Shefi, and M. Teboulle, A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems, SIAM Journal on Optimization, vol.20, issue.6, pp.3232-3259, 2010.
DOI : 10.1137/090763317
URL : https://hal.archives-ouvertes.fr/hal-00965630

A. Beck and M. Teboulle, Gradient-based algorithms with applications to signal-recovery problems, Convex Optimization in Signal Processing and Communications, pp.42-88, 2010.
DOI : 10.1017/CBO9780511804458.003

D. Bertsekas, Nonlinear Programming, Athena Scientific, 1995.

J. Bolte, A. Daniilidis, A. Lewis, and M. Shiota, Clarke Subgradients of Stratifiable Functions, SIAM Journal on Optimization, vol.18, issue.2, pp.556-572, 2007.
DOI : 10.1137/060670080

J. Bolte, A. Daniilidis, and A. S. Lewis, The ??ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems, SIAM Journal on Optimization, vol.17, issue.4, pp.1205-1223, 2007.
DOI : 10.1137/050644641

J. Bolte, S. Sabach, and M. Teboulle, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, Mathematical Programming, pp.1-36, 2013.
DOI : 10.1007/s10107-013-0701-9
URL : https://hal.archives-ouvertes.fr/hal-00916090

J. F. Bonnans, J. Ch, C. Gilbert, C. Lemaréchal, and . Sagastizábal, Numerical Optimization: Theoretical and Practical Aspects, 2003.
DOI : 10.1007/978-3-662-05078-1

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

R. Byrd, N. Gould, J. Nocedal, and R. Waltz, On the Convergence of Successive Linear-Quadratic Programming Algorithms, SIAM Journal on Optimization, vol.16, issue.2, pp.471-489, 2005.
DOI : 10.1137/S1052623403426532

C. Cartis, N. Gould, and P. L. Toint, On the complexity of finding first-order critical points in constrained nonlinear optimization, Mathematical Programming, vol.3, issue.1, pp.93-106, 2014.
DOI : 10.1007/s10107-012-0617-9

E. Chouzenoux, A. Jezierska, J. Pesquet, and H. Talbot, A Majorize-Minimize Subspace Approach for $\ell_2-\ell_0$ Image Regularization, SIAM Journal on Imaging Sciences, vol.6, issue.1, pp.563-591, 2013.
DOI : 10.1137/11085997X

P. L. Combettes, J. Pesquet, H. H. Bauschke, R. S. Burachik, P. L. Combettes et al., Proximal Splitting Methods in Signal Processing, Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp.185-212, 2011.
DOI : 10.1007/978-1-4419-9569-8_10
URL : https://hal.archives-ouvertes.fr/hal-00643807

B. Cox, A. Juditsky, and A. Nemirovski, Dual subgradient algorithms for large-scale nonsmooth learning problems, Mathematical Programming, pp.1-38, 2013.
DOI : 10.1007/s10107-013-0725-1
URL : https://hal.archives-ouvertes.fr/hal-00978358

A. P. Dempster, N. M. Laird, and D. B. Rubin, Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society. Series B (Methodological), pp.1-38, 1977.

A. Dontchev and R. T. Rockafellar, Implicit functions and solution mappings, 2009.

L. Van-den-dries and C. Miller, Geometric categories and o-minimal structures, Duke Mathematical Journal, vol.84, issue.2, pp.497-540, 1996.
DOI : 10.1215/S0012-7094-96-08416-1

R. Fletcher, An ? 1 penalty method for nonlinear constraints, Numerical Optimization, pp.26-40, 1985.

R. Fletcher, Practical Methods of Optimization, 2000.
DOI : 10.1002/9781118723203

R. Fletcher, N. Gould, S. Leyffer, P. Toint, and A. Wächter, Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming, SIAM Journal on Optimization, vol.13, issue.3, pp.635-659, 2002.
DOI : 10.1137/S1052623499357258

M. Fukushima, Z. Luo, and P. Tseng, A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization, SIAM Journal on Optimization, vol.13, issue.4, pp.1098-1119, 2003.
DOI : 10.1137/S1052623401398120

P. E. Gill, W. Murray, and M. Saunders, SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization, SIAM Review, vol.47, issue.1, pp.99-131, 2005.
DOI : 10.1137/S0036144504446096

P. E. Gill and E. Wong, Sequential Quadratic Programming Methods The IMA Volumes in Mathematics and its Applications, Mixed Integer Nonlinear Programming, pp.147-224, 2012.

S. P. Han, A globally convergent method for nonlinear programming, Journal of Optimization Theory and Applications, vol.5, issue.3, pp.297-309, 1977.
DOI : 10.1007/BF00932858

W. L. Hare and A. S. Lewis, Identifying Active Constraints via Partial Smoothness and Prox-Regularity, Journal of Convex Analysis, vol.11, issue.2, pp.251-266, 2004.

A. Lewis, Active Sets, Nonsmoothness, and Sensitivity, SIAM Journal on Optimization, vol.13, issue.3, pp.702-725, 2002.
DOI : 10.1137/S1052623401387623

N. Maratos, Exact penalty function algorithms for finite dimensional and control optimization problems, 1978.

Y. Nesterov, Introductory lectures on convex optimization: A basic course, 2004.
DOI : 10.1007/978-1-4419-8853-9

J. Nocedal and S. Wright, Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2006.

D. Noll, Convergence of Non-smooth Descent Methods Using the Kurdyka?????ojasiewicz Inequality, Journal of Optimization Theory and Applications, vol.43, issue.1, pp.553-572, 2014.
DOI : 10.1007/s10957-013-0391-8

J. M. Ortega and W. C. Rheinboldt, Iterative Solution of Nonlinear Equations in Several Variables, SIAM, vol.30, 1970.
DOI : 10.1137/1.9780898719468

M. J. Powell, On search directions for minimization algorithms, Mathematical Programming, vol.3, issue.1, pp.193-201, 1973.
DOI : 10.1007/BF01584660

R. T. Rockafellar and R. Wets, Variational analysis, 1998.
DOI : 10.1007/978-3-642-02431-3

M. V. Solodov, On the Sequential Quadratically Constrained Quadratic Programming Methods, Mathematics of Operations Research, vol.29, issue.1, pp.64-79, 2004.
DOI : 10.1287/moor.1030.0069

M. V. Solodov, Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences, Mathematical Programming, vol.7, issue.1, pp.1-12, 2009.
DOI : 10.1007/s10107-007-0180-y

K. Svanberg, A Class of Globally Convergent Optimization Methods Based on Conservative Convex Separable Approximations, SIAM Journal on Optimization, vol.12, issue.2, pp.555-573, 2002.
DOI : 10.1137/S1052623499362822

A. Wilson, Simplicial Method for Convex Programming, 1963.

S. J. Wright, Constraint identification and algorithm stabilization for degenerate nonlinear programs, Mathematical Programming, pp.137-160, 2003.
DOI : 10.1007/s10107-002-0344-8