I. Akrotirianakis and B. Rustem, A primal-dual interior point algorithm with an exact and differentiable merit function for nonlinear programming
DOI : 10.1080/10556780008805791

, International Conference on Nonlinear Programming and Variational Inequalities, vol.14, p.9, 1998.

I. Akrotirianakis and B. Rustem, Globally convergent interior-point algorithm for nonlinear programming, J. Optim. Theory Appl, vol.125, issue.3, pp.497-521, 2005.
DOI : 10.1007/s10957-005-2086-2

R. Andreani, E. G. Birgin, J. M. Martínez, and M. L. Schuverdt, On augmented Lagrangian methods with general lower-level constraints, SIAM J. Optim, vol.18, issue.4, p.51, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01295437

R. Andreani, J. M. Martínez, and M. L. Schuverdt, On second-order optimality conditions for nonlinear programming, Optimization, vol.56, issue.5-6, p.25, 2007.
DOI : 10.1080/02331930701618617

R. Andreani, E. G. Birgin, J. M. Martí, and M. L. Schuverdt, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, Math. Program, vol.111, pp.5-32, 2008.
DOI : 10.1007/s10107-006-0077-1
URL : http://www.ime.usp.br/~egbirgin/publications/abms.pdf

M. Anitescu, A superlinearly convergent sequential quadratically constrained quadratic programming algorithm for degenerate nonlinear programming, Bibliography SIAM J. Optim, vol.12, issue.4, pp.949-978, 2002.

M. Argáez and R. A. Tapia, On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming, J. Optim. Theory Appl, vol.114, issue.1, pp.1-25, 2002.

P. Armand, A quasi-Newton penalty barrier method for convex minimization problems, Comput. Optim. Appl, vol.26, issue.1, pp.5-34, 2003.

P. Armand and J. Benoist, A local convergence property of primal-dual methods for nonlinear programming, Math. Program, vol.115, issue.2, p.120, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00320569

P. Armand and J. Benoist, Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods, Math. Program, vol.137, issue.1-2, p.92, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00683008

P. Armand and I. Lankoandé, An inexact proximal regularization method for unconstrained optimization, Math. Methods Oper. Res, vol.85, issue.1, p.79, 2017.
DOI : 10.1007/s00186-016-0561-1
URL : https://hal.archives-ouvertes.fr/hal-01710154

P. Armand and R. Omheni, A globally and quadratically convergent primaldual augmented Lagrangian algorithm for equality constrained optimization, Optim. Methods Softw, vol.32, issue.1, p.162, 2017.
DOI : 10.1080/10556788.2015.1025401
URL : https://hal.archives-ouvertes.fr/hal-01313701

P. Armand and R. Omheni, A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization, J. Optim. Theory Appl, vol.173, issue.2, p.162, 2017.
DOI : 10.1007/s10957-017-1071-x
URL : https://hal.archives-ouvertes.fr/hal-01710165

P. Armand, J. Benoist, and D. Orban, Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
URL : https://hal.archives-ouvertes.fr/hal-00320621

, Optim. Appl, vol.41, issue.1, p.152, 2008.

P. Armand, J. Benoist, and D. Orban, From global to local convergence of interior methods for nonlinear optimization, Optim. Methods Softw, vol.28, issue.5, p.74, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00920220

P. Armand, J. Benoist, R. Omheni, and V. Pateloup, Study of a primal-dual algorithm for equality constrained minimization, Comput. Optim. Appl, vol.59, issue.3, p.75, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00683022

S. Arreckx and D. Orban, A Regularized Factorization-Free Method for Equality-Constrained Optimization, SIAM J. Optim, vol.28, issue.2, p.172, 2018.
DOI : 10.1137/16m1088570

A. Benchakroun, J. Dussault, and A. Mansouri, A two parameter mixed interior-exterior penalty algorithm, ZOR-Math. Methods Oper. Res, vol.41, issue.1, pp.25-55, 1995.
DOI : 10.1007/bf01415063

H. Y. Benson, D. F. Shanno, and R. J. Vanderbei, Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
DOI : 10.1007/s10107-003-0418-2

, Math. Program, vol.99, issue.1, pp.35-48, 2004.

D. P. Bertsekas, Convergence rate of penalty and multiplier methods, 1973 IEEE Conference on Decision and Control including the 12th Symposium on Adaptive Processes, pp.260-264, 1973.

D. P. Bertsekas, Constrained optimization and Lagrange multiplier methods, Computer Science and Applied Mathematics, vol.6, p.32

, Infeasibility detection and regularization strategies in nonlinear optimization 175

D. P. Bertsekas, Nonlinear programming. Athena Scientific Optimization and Computation Series, Athena Scientific, vol.127, p.144, 1999.

E. G. Birgin, C. A. Floudas, and J. M. Martínez, Global minimization using an augmented Lagrangian method with variable lower-level constraints, Math. Program, vol.125, issue.1, pp.139-162, 2010.

E. G. Birgin, D. Fernández, and J. M. Martínez, The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems, Optim. Methods Softw, vol.27, issue.6, pp.1001-1024, 2012.

E. G. Birgin, J. M. Martínez, and L. F. Prudente, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, J. Global Optim, vol.58, issue.2, pp.207-242, 2014.

E. G. Birgin, J. M. Martínez, and L. F. Prudente, Optimality properties of an augmented Lagrangian method on infeasible problems, Comput. Optim. Appl, vol.60, issue.3, pp.609-631, 2015.

C. G. Broyden and N. F. Attia, A smooth sequential penalty function method for solving nonlinear programming problems, System modelling and optimization, vol.59, pp.237-245, 1983.

C. G. Broyden and N. F. Attia, Penalty functions, Newton's method and quadratic programming, J. Optim. Theory Appl, vol.58, issue.3, pp.377-385, 1988.

J. V. Burke and M. C. Ferris, Weak sharp minima in mathematical programming, SIAM J. Control Optim, vol.31, issue.5, pp.1340-1359, 1993.

J. V. Burke, F. E. Curtis, and H. Wang, A sequential quadratic optimization algorithm with rapid infeasibility detection, SIAM J. Optim, vol.24, issue.2, p.161, 2014.

J. D. Buys, Dual algorithms for constrained optimization problems, vol.5, p.7, 1972.

R. H. Byrd, R. A. Tapia, and Y. Zhang, An SQP augmented Lagrangian BFGS algorithm for constrained optimization, SIAM J. Optim, vol.2, issue.2, pp.210-241, 1992.

R. H. Byrd, G. Liu, and J. Nocedal, On the local behaviour of an interior point method for nonlinear programming, Numerical analysis 1997 (Dundee), vol.380, p.120, 1998.

R. H. Byrd, M. E. Hribar, J. Nocedal, and J. Dennis, An interior point algorithm for large-scale nonlinear programming, SIAM J. Optim, vol.9, issue.4, pp.877-900, 1999.

R. H. Byrd, J. C. Gilbert, and J. Nocedal, A trust region method based on interior point techniques for nonlinear programming, Math. Program, vol.89, issue.1, pp.149-185, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00073794

R. H. Byrd, J. Nocedal, and R. A. Waltz, Feasible interior methods using slacks for nonlinear optimization, Comput. Optim. Appl, vol.26, issue.1, pp.35-61, 2003.

R. H. Byrd, N. I. Gould, J. Nocedal, and R. A. Waltz, An algorithm for nonlinear optimization using linear programming and equality constrained subproblems, Math. Program, vol.100, issue.1, pp.27-48, 2004.

R. H. Byrd, J. Nocedal, and R. A. Waltz, KNITRO: An integrated package for nonlinear optimization, Large-scale nonlinear optimization, vol.83, p.9, 2006.

R. H. Byrd, J. Nocedal, and R. A. Waltz, Steering exact penalty methods for nonlinear programming, Optim. Methods Softw, vol.23, issue.2, pp.197-213, 2008.

R. H. Byrd, F. E. Curtis, and J. Nocedal, Infeasibility detection and SQP methods for nonlinear optimization, SIAM J. Optim, vol.20, issue.5, p.161, 2010.

J. Castro and J. Cuesta, Quadratic regularizations in an interior-point method for primal block-angular problems, Math. Program, vol.130, issue.2, p.78, 2011.

L. Chen and D. Goldfarb, Interior-point l 2-penalty methods for nonlinear programming with strong global convergence properties, Math. Program, vol.108, issue.1, pp.1-36, 2006.

C. M. Chin and R. Fletcher, On the global convergence of an SLP-filter algorithm that takes EQP steps, Math. Program, vol.96, issue.1, pp.161-177, 2003.

A. R. Conn, N. I. Gould, and P. L. Toint, A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds, SIAM J. Numer. Anal, vol.28, issue.2, pp.545-572, 1991.

A. R. Conn, N. I. Gould, P. L. Toint, and . Lancelot, Springer Series in Computational Mathematics, vol.17, 1992.

, A Fortran package for large-scale nonlinear optimization (release A)

A. R. Conn, N. I. Gould, D. Orban, and P. L. Toint, A primal-dual trustregion algorithm for non-convex nonlinear programming, Math. Program, vol.87, issue.2, pp.215-249, 2000.

A. R. Conn, N. I. Gould, and P. L. Toint, Trust-region methods, MPS/SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), 2000.

R. Courant, Variational methods for the solution of problems of equilibrium and vibrations, Bull. Amer. Math. Soc, vol.49, pp.1-23, 1943.

F. E. Curtis, A penalty-interior-point algorithm for nonlinear constrained optimization, Math. Program. Comput, vol.4, issue.2, pp.181-209, 2012.
DOI : 10.1007/s12532-012-0041-4

Y. Dai, X. Liu, and J. Sun, A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs, vol.10, p.161, 2018.

G. Debreu, Definite and semidefinite quadratic forms, Econometrica, vol.20, pp.295-300, 1952.
DOI : 10.2307/1907852

J. E. Dennis, M. Heinkenschloss, and L. N. Vicente, Trust-region interiorpoint SQP algorithms for a class of nonlinear programming problems

, J. Control Optim, vol.36, issue.5, pp.1750-1794, 1998.

J. E. Dennis, J. , and R. B. Schnabel, Numerical methods for unconstrained optimization and nonlinear equations, of Classics in Applied Infeasibility detection and regularization strategies in nonlinear optimization 179 Bibliography Mathematics, vol.16, 1996.
DOI : 10.1137/1.9781611971200

, Corrected reprint of the 1983 original, vol.16, p.66

G. , D. Pillo, and L. Grippo, A new class of augmented Lagrangians in nonlinear programming, SIAM J. Control Optim, vol.17, issue.5, pp.618-628, 1979.

G. , D. Pillo, and L. Grippo, A new augmented Lagrangian function for inequality constraints in nonlinear programming problems, J. Optim. Theory Appl, vol.36, issue.4, pp.495-519, 1982.

E. D. Dolan and J. J. Moré, Benchmarking optimization software with performance profiles, Math. Program, vol.91, issue.2, pp.201-213, 2002.
DOI : 10.1007/s101070100263
URL : http://arxiv.org/pdf/cs/0102001

, , vol.47, p.75

E. D. Dolan, J. J. Moré, and T. S. Munson, Benchmarking optimization software with cops 3.0, Argonne National Lab, p.157, 2004.
DOI : 10.2172/775270
URL : http://www.mcs.anl.gov/~tmunson/papers/cops.pdf

I. S. Duff, MA57-a code for the solution of sparse symmetric definite and indefinite systems, ACM Trans. Math. Software, vol.30, issue.2, p.75, 2004.

J. Dussault and A. Elafia, On the superlinear convergence order of the logarithmic barrier algorithm, Comput. Optim. Appl, vol.19, issue.1, pp.31-53, 2001.

A. S. El-bakry, R. A. Tapia, T. Tsuchiya, and Y. Zhang, On the formulation and theory of the Newton interior-point method for nonlinear programming

, J. Optim. Theory Appl, vol.89, issue.3, pp.507-541, 1996.

H. Esmaeili and M. Kimiaei, A trust-region method with improved adaptive radius for systems of nonlinear equations, Math. Methods Oper. Res, vol.83, issue.1, pp.109-125, 2016.

F. Facchinei, A. Fischer, and C. Kanzow, On the accurate identification of active constraints, SIAM J. Optim, vol.9, issue.1, pp.14-32, 1998.

J. Fan and Y. Yuan, A regularized Newton method for monotone nonlinear equations and its application, Optim. Methods Softw, vol.29, issue.1, pp.102-119, 2014.

A. V. Fiacco and G. P. Mccormick, Nonlinear programming: Sequential unconstrained minimization techniques, vol.8, p.17, 1968.

A. Fischer, Modified Wilson's method for nonlinear programs with nonunique multipliers, Math. Oper. Res, vol.24, issue.3, pp.699-727, 1999.
DOI : 10.1287/moor.24.3.699

R. Fletcher, Practical methods of optimization, 1987.
DOI : 10.1002/9781118723203

R. Fletcher and S. Leyffer, Nonlinear programming without a penalty function, Math. Program, vol.91, issue.2, p.9, 2002.
DOI : 10.1007/s101070100244

R. Fletcher and E. Sáinz-de-la-maza, Nonlinear programming and nonsmooth optimization by successive linear programming, Math. Programming, vol.43, issue.3, pp.235-256, 1989.
DOI : 10.1007/bf01582292

R. Fletcher, N. I. Gould, S. Leyffer, P. L. Toint, and A. Wächter, Global convergence of a trust-region SQP-filter algorithm for general nonlinear programming, SIAM J. Optim, vol.13, issue.3, pp.635-659, 2002.

A. Forsgren and P. E. Gill, Primal-dual interior methods for nonconvex nonlinear programming
DOI : 10.1137/s1052623496305560
URL : http://www.math.kth.se/~andersf/doc/siopt30556.pdf

, SIAM J. Optim, vol.8, issue.4, p.15, 1998.

A. Forsgren, P. E. Gill, and M. H. Wright, Interior methods for nonlinear optimization, SIAM Rev, vol.44, issue.4, pp.525-597, 2002.

M. P. Friedlander and D. Orban, A primal-dual regularized interior-point method for convex quadratic programs, Math. Program. Comput, vol.4, issue.1, p.172, 2012.

K. R. Frisch, The logarithmic potential method of convex programming, 1955.

D. M. Gay, M. L. Overton, and M. H. Wright, A primal-dual interior method for nonconvex nonlinear programming, Advances in nonlinear programming, vol.14, pp.31-56, 1996.

, , 1998.

E. M. Gertz and P. E. Gill, A primal-dual trust region algorithm for nonlinear optimization, Math. Program, vol.100, issue.1, pp.49-94, 2004.

P. E. Gill and D. P. Robinson, A primal-dual augmented Lagrangian

, Comput. Optim. Appl, vol.51, issue.1, p.36, 2012.

P. E. Gill and D. P. Robinson, A globally convergent stabilized SQP method, SIAM J. Optim, vol.23, issue.4, pp.1983-2010, 2013.

, , vol.5, p.9

P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Some theoretical properties of an augmented Lagrangian merit function, Advances in Optimization and Parallel Computing, pp.101-128, 1992.

P. E. Gill, W. Murray, and M. A. Saunders, SNOPT: an SQP algorithm for large-scale constrained optimization, SIAM Rev, vol.47, issue.1, pp.99-131, 2005.

P. E. Gill, V. Kungurtsev, and D. P. Robinson, A stabilized SQP method: superlinear convergence, Math. Program, vol.163, issue.1-2, p.7, 2017.

P. E. Gill, V. Kungurtsev, and D. P. Robinson, A stabilized SQP method: global convergence, IMA J. Numer. Anal, vol.37, issue.1, pp.407-443, 2017.

D. Goldfarb, R. Polyak, K. Scheinberg, and I. Yuzefovich, A modified barrieraugmented Lagrangian method for constrained minimization

, Optim. Appl, vol.14, issue.1, p.9, 1999.

M. L. Gonçalves, J. G. Melo, and L. F. Prudente, Augmented Lagrangian methods for nonlinear programming with possible infeasibility, J. Global Optim, vol.63, issue.2, pp.297-318, 2015.

N. Gould, D. Orban, and P. Toint, Numerical methods for large-scale nonlinear optimization, Acta Numer, vol.14, pp.299-361, 2005.

N. I. Gould, On the accurate determination of search directions for simple differentiable penalty functions, IMA J. Numer. Anal, vol.6, issue.3, pp.357-372, 1986.

N. I. Gould, On the convergence of a sequential penalty function method for constrained minimization, SIAM J. Numer. Anal, vol.26, issue.1, pp.107-128, 1989.

, Infeasibility detection and regularization strategies in nonlinear optimization 183

N. I. Gould and D. P. Robinson, A second derivative SQP method: global convergence, SIAM J. Optim, vol.20, issue.4, pp.2023-2048, 2010.
DOI : 10.1137/080744542

N. I. Gould and D. P. Robinson, A second derivative SQP method: local convergence and practical issues, SIAM J. Optim, vol.20, issue.4, pp.2049-2079, 2010.

N. I. Gould, D. Orban, A. Sartenaer, and P. L. Toint, Superlinear convergence of primal-dual interior point algorithms for nonlinear programming, SIAM J. Optim, vol.11, issue.4, p.78, 2001.

N. I. Gould, D. Orban, A. Sartenaer, and P. L. Toint, Componentwise fast convergence in the solution of full-rank systems of nonlinear equations, Math. Program, vol.92, issue.3, p.78, 2000.

N. I. Gould, D. Orban, and P. L. Toint, CUTEr and SifDec: a Constrained and Unconstrained Testing Environment, revisited, ACM Trans. Math. Software, vol.29, issue.4, p.157, 2003.

O. Güler, Foundations of optimization, Graduate Texts in Mathematics, vol.258, 2010.

W. W. Hager, Computational optimization-a tribute to Olvi Mangasarian, Part I, Comput. Optim. Appl, vol.12, issue.1-3, p.7, 1999.

W. W. Hager and M. S. Gowda, Stability in the presence of degeneracy and error estimation, Math. Program, vol.85, issue.1, p.145, 1999.

W. W. Hager and H. Zhang, Self-adaptive inexact proximal point methods
DOI : 10.1007/s10589-007-9067-3

, Comput. Optim. Appl, vol.39, issue.2, pp.161-181, 2008.

M. R. Hestenes, Multiplier and gradient methods, J. Optimization Theory Appl, vol.4, pp.303-320, 1969.
DOI : 10.1007/bf00927673

W. Hock and K. Schittkowski, Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, vol.187, 1981.
DOI : 10.1007/bf00934594

R. A. Horn and C. R. Johnson, Matrix analysis, vol.16, p.17, 2013.

A. Iusem and R. G. Otero, Augmented Lagrangian methods for coneconstrained convex optimization in Banach spaces, J. Nonlinear Convex Anal, vol.3, issue.2, pp.155-176, 2002.

A. F. Izmailov and M. V. Solodov, Newton-type methods for optimization problems without constraint qualifications, SIAM J. Optim, vol.15, issue.1, pp.210-228, 2004.
DOI : 10.1137/s1052623403427264
URL : http://www.cs.wisc.edu/~solodov/izmsol03noCQ.pdf

A. F. Izmailov and M. V. Solodov, Stabilized SQP revisited. Math. Program, vol.133, issue.1-2, pp.93-120, 2012.

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.4, issue.4, pp.373-395, 1984.
DOI : 10.1145/800057.808695

M. Kojima, S. Mizuno, and A. Yoshise, A primal-dual interior point algorithm for linear programming, Progress in mathematical programming, pp.29-47, 1987.
DOI : 10.1007/978-1-4613-9617-8_2

B. W. Kort and D. P. Bertsekas, A new penalty function method for constrained minimization, 1972 IEEE Conference on Decision and Control including the 11th Symposium on Adaptive Processes, pp.162-166, 1972.

B. W. Kort and D. P. Bertsekas, Combined primal-dual and penalty methods for convex programming, SIAM J. Control Optimization, vol.14, issue.2, p.6, 1976.

M. K?ocvarak?ocvara and M. Stingl, Pennon: a code for convex nonlinear and semidefinite programming, Optim. Methods Softw, vol.18, issue.3, pp.317-333, 2003.

D. Li, M. Fukushima, L. Qi, and N. Yamashita, Regularized Newton methods for convex minimization problems with singular solutions, Comput. Optim. Appl, vol.28, issue.2, p.105, 2004.

X. Liu and J. Sun, A robust primal-dual interior-point algorithm for nonlinear programs, SIAM J. Optim, vol.14, issue.4, pp.1163-1186, 2004.

X. W. Liu and J. Sun, Global convergence analysis of line search interiorpoint methods for nonlinear programming without regularity assumptions

J. Optim, Theory Appl, vol.125, issue.3, pp.609-628, 2005.

F. A. Lootsma, Hessian matrices of penalty functions for solving constrainedoptimization problems, Philips Res. Rep, vol.24, pp.322-330, 1969.

I. J. Lustig, R. E. Marsten, and D. F. Shanno, On implementing Mehrotra's predictor-corrector interior-point method for linear programming, SIAM J. Optim, vol.2, issue.3, pp.435-449, 1992.

J. M. Martínez and L. D. Prudente, Handling infeasibility in a largescale nonlinear optimization algorithm, Numerical Algorithms, vol.60, issue.2, pp.263-277, 2012.

J. M. Moguerza and F. J. Prieto, An augmented Lagrangian interior-point method using directions of negative curvature, Math. Program, vol.95, issue.3, pp.573-616, 2003.

W. Murray, Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions, J. Optimization Theory Appl, vol.7, pp.189-196, 1971.

B. A. Murtagh and M. A. Saunders, MINOS 5.51 user's guide, 2003.

A. S. Nemirovski and M. J. Todd, Interior-point methods for optimization

A. Numerica, , vol.17, pp.191-234, 2008.

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

J. Nocedal, F. Öztoprak, and R. A. Waltz, An interior point method for nonlinear programming with infeasibility detection capabilities

, Methods Softw, vol.29, issue.4, p.9, 2014.

R. Omheni, Méthodes primales-duales régularisées pour l'optimisation non linéaire avec contraintes, École Doctorale S2IM, vol.62, p.75, 2014.

J. Pang, Error bounds in mathematical programming

. Programming, , pp.299-332, 1997.

, Lectures on mathematical programming (ismp97), p.27, 1997.

N. Parikh and S. Boyd, Proximal algorithms. Found. Trends Optim, vol.1, issue.3, pp.127-239, 2014.

, Infeasibility detection and regularization strategies in nonlinear optimization 187

E. Polak and A. L. Tits, A globally convergent, implementable multiplier method with automatic penalty limitation, Appl. Math. Optim, vol.6, issue.4, pp.335-360, 1980.
DOI : 10.1109/cdc.1980.271787

R. Polyak, Modified barrier functions (theory and methods), Math. Programming, vol.54, issue.2, pp.177-222, 1992.
DOI : 10.1007/bf01586050

R. A. Polyak, On the local quadratic convergence of the primal-dual augmented Lagrangian method, Optim. Methods Softw, vol.24, issue.3, pp.369-379, 2009.

,

M. J. Powell, A method for nonlinear constraints in minimization problems, Optimization (Sympos., Univ. Keele, pp.283-298, 1968.

L. Qi and Z. Wei, On the constant positive linear dependence condition and its application to SQP methods, SIAM J. Optim, vol.10, issue.4, pp.963-981, 2000.
DOI : 10.1137/s1052623497326629

D. Ralph and S. J. Wright, Superlinear convergence of an interiorpoint method for monotone variational inequalities, Complementarity and variational problems, vol.10, p.120, 1995.

D. Ralph and S. J. Wright, Superlinear convergence of an interior-point method despite dependent constraints, Math. Oper. Res, vol.25, issue.2, p.137, 2000.

D. P. Robinson, Primal-dual methods for nonlinear optimization, p.36, 2007.

D. P. Robinson, Primal-dual active-set methods for large-scale optimization
DOI : 10.1007/s10957-015-0708-x

, J. Optim. Theory Appl, vol.166, issue.1, pp.137-171, 2015.

,

R. T. Rockafellar, The multiplier method of Hestenes and Powell applied to convex programming, J. Optimization Theory Appl, vol.12, pp.555-562, 1973.

R. T. Rockafellar, New applications of duality in nonlinear programming, pp.73-81, 1973.

R. T. Rockafellar, Augmented Lagrange multiplier functions and duality in nonconvex programming, SIAM J. Control, vol.12, issue.5, pp.268-285, 1974.
DOI : 10.1137/0312021

K. Schittkowski, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis, Numer. Math, vol.38, issue.1, pp.83-114, 1981.

K. Schittkowski, On the convergence of a sequential quadratic programming method with an augmented Lagrangian line search function, Math. Operationsforsch. Statist. Ser. Optim, vol.14, issue.2, pp.197-216, 1983.

D. Serre and . Matrices, Graduate Texts in Mathematics, vol.216, p.148, 2010.

C. Shen, L. Zhang, B. Wang, and W. Shao, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, Computational Optimization and Applications, vol.59, issue.3, pp.435-473, 2014.

R. A. Tapia, Diagonalized multiplier methods and quasi-Newton methods for constrained optimization, Infeasibility detection and regularization strategies in nonlinear optimization 189 Bibliography, vol.22, pp.135-194

,

A. L. Tits, A. Wächter, S. Bakhtiari, T. J. Urban, and C. T. Lawrence, A primal-dual interior-point method for nonlinear programming with strong global and local convergence properties, SIAM J. Optim, vol.14, issue.1, pp.173-199, 2003.

, , vol.9, p.10

P. Tseng, Error bounds and superlinear convergence analysis of some Newton-type methods in optimization, Nonlinear optimization and related topics, vol.36, pp.445-462, 1998.

P. Tseng, Convergent infeasible interior-point trust-region methods for constrained minimization, SIAM J. Optim, vol.13, issue.2, pp.432-469, 2002.

P. Tseng and S. Yun, Incrementally updated gradient methods for constrained and regularized optimization, J. Optim. Theory Appl, vol.160, issue.3, pp.832-853, 2014.

K. Ueda and N. Yamashita, A regularized Newton method without line search for unconstrained optimization, Comput. Optim. Appl, vol.59, issue.1-2, p.79, 2014.

M. Ulbrich, S. Ulbrich, and L. S. Vicente, A globally convergent primal-dual interior-point filter method for nonlinear programming, Math. Program, vol.100, issue.2, pp.379-410, 2004.

S. Ulbrich, On the superlinear local convergence of a filter-SQP method, Mathematical Programming, vol.100, issue.1, pp.217-245, 2004.

R. J. Vanderbei and D. F. Shanno, An interior-point algorithm for nonconvex nonlinear programming, Comput. Optim. Appl, vol.13, issue.1-3, p.9, 1999.

L. N. Vicente and S. J. Wright, Local convergence of a primal-dual method for degenerate nonlinear programming, Comput. Optim. Appl, vol.22, issue.3, p.120, 2002.

A. Wächter and L. T. Biegler, Failure of global convergence for a class of interior point methods for nonlinear programming, Math. Program, vol.88, issue.3, pp.565-574, 2000.

A. Wächter and L. T. Biegler, On the implementation of an interiorpoint filter line-search algorithm for large-scale nonlinear programming

, Math. Program, vol.106, issue.1, p.108, 2006.

R. A. Waltz, J. L. Morales, J. Nocedal, and D. Orban, An interior algorithm for nonlinear optimization that combines line search and trust region steps

, Math. Program, vol.107, issue.3, pp.391-408, 2006.

C. Wang, J. Zhang, and W. Zhao, Two error bounds for constrained optimization problems and their applications, Appl. Math. Optim, vol.57, issue.3, pp.307-328, 2008.
DOI : 10.1007/s00245-007-9023-8

R. B. Wilson, A Simplicial Algorithm for Concave Programming, 1963.

S. J. Wright, Superlinear convergence of a stabilized SQP method to a degenerate solution, Comput. Optim. Appl, vol.11, issue.3, p.7, 1998.

, Infeasibility detection and regularization strategies in nonlinear optimization 191

S. J. Wright, Effects of finite-precision arithmetic on interior-point methods for nonlinear programming, SIAM J. Optim, vol.12, issue.1, p.147, 2001.
DOI : 10.1137/s1052623498347438
URL : http://arxiv.org/pdf/math/0103102

S. J. Wright, Modifying SQP for degenerate problems, SIAM J. Optim, vol.13, issue.2, p.147, 2002.
DOI : 10.1137/s1052623498333731
URL : http://www.cs.wisc.edu/~swright/papers/P699_3.pdf

S. J. Wright, Constraint identification and algorithm stabilization for degenerate nonlinear programs, Math. Program, vol.95, issue.1, p.4, 2000.
DOI : 10.1007/s10107-002-0344-8
URL : http://arxiv.org/pdf/math/0012209

S. J. Wright, An algorithm for degenerate nonlinear programming with rapid local convergence, SIAM J. Optim, vol.15, issue.3, p.147, 2005.
DOI : 10.1137/030601235
URL : http://www.optimization-online.org/DB_FILE/2003/09/723.pdf

S. J. Wright and D. Orban, Properties of the log-barrier function on degenerate nonlinear programs, Math. Oper. Res, vol.27, issue.3, pp.585-613, 2002.

H. Yamashita, A globally convergent primal-dual interior point method for constrained optimization, Optim. Methods Softw, vol.10, issue.2, pp.443-469, 1998.
DOI : 10.1080/10556789808805723

, Dedicated to Professor Masao Iri on the occasion of his 65th birthday

H. Yamashita and H. Yabe, Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization, Math. Program, vol.75, issue.3, pp.377-397, 1996.
DOI : 10.1007/bf02592190

H. Yamashita and H. Yabe, An interior point method with a primaldual quadratic barrier penalty function for nonlinear optimization, SIAM J. Optim, vol.14, issue.2, pp.479-499, 2003.
DOI : 10.1137/s1052623499355533

/. S1052623499355533,

H. Yamashita and H. Yabe, Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems

, Comput. Optim. Appl, vol.31, issue.2, p.147, 2005.

H. Yamashita, H. Yabe, and T. Tanabe, A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization, Math. Program, vol.102, issue.1, p.10, 2005.
DOI : 10.1007/s10107-004-0508-9

N. Yamashita and M. Fukushima, On the rate of convergence of the Levenberg-Marquardt method, Topics in numerical analysis, vol.15, pp.239-249, 2001.