I. Akrotirianakis and B. Rustem, A primal-dual interior point algorithm with an exact and differentiable merit function for nonlinear programming, International Conference on Nonlinear Programming and Variational Inequalities, pp.1-36, 1998.
DOI : 10.1080/10556780008805791

I. Akrotirianakis and B. Rustem, Globally Convergent Interior-Point Algorithm for Nonlinear Programming, Journal of Optimization Theory and Applications, vol.49, issue.3, pp.497-521, 2005.
DOI : 10.1007/s10957-005-2086-2

P. R. Amestoy, I. S. Duff, J. Excellent, and J. Koster, A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling, SIAM Journal on Matrix Analysis and Applications, vol.23, issue.1, pp.15-41, 2001.
DOI : 10.1137/S0895479899358194
URL : https://hal.archives-ouvertes.fr/hal-00808293

R. Andreani, E. G. Birgin, J. M. Martínez, and M. L. Schuverdt, On Augmented Lagrangian Methods with General Lower-Level Constraints, SIAM Journal on Optimization, vol.18, issue.4, pp.1286-1309, 2007.
DOI : 10.1137/060654797
URL : https://hal.archives-ouvertes.fr/hal-01295437

R. Andreani, E. G. Birgin, J. M. Martínez, and M. L. Schuverdt, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, Mathematical Programming, vol.30, issue.1-2, pp.5-32, 2008.
DOI : 10.1007/s10107-006-0077-1

M. Argáez and R. A. Tapia, On the Global Convergence of a Modified Augmented Lagrangian Linesearch Interior-Point Newton Method for Nonlinear Programming, Journal of Optimization Theory and Applications, vol.1, issue.1, pp.1-25, 2002.
DOI : 10.1023/A:1015451203254

P. Armand, A quasi-Newton penalty barrier method for convex minimization problems, Computational Optimization and Applications, vol.26, issue.1, pp.5-34, 2003.
DOI : 10.1023/A:1025589804531

P. Armand and J. Benoist, A local convergence property of primal-dual methods for nonlinear programming, Mathematical Programming, vol.102, issue.2, pp.199-222, 2008.
DOI : 10.1007/s10107-007-0136-2
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, Mathematical Programming, vol.106, issue.1, Ser. A, pp.587-592, 2013.
DOI : 10.1007/s10107-011-0498-3
URL : https://hal.archives-ouvertes.fr/hal-00683008

P. Armand, J. Benoist, and J. P. Dussault, Local path-following property of inexact interior methods in nonlinear programming, Computational Optimization and Applications, vol.106, issue.1, pp.209-238, 2012.
DOI : 10.1007/s10589-011-9406-2
URL : https://hal.archives-ouvertes.fr/hal-00682785

P. Armand, J. Benoist, R. Omheni, and V. Pateloup, Study of a primal-dual method for equality constrained minimization, Comput. Optim. Appl, vol.30, issue.33, pp.1-29, 2014.

P. Armand, J. Benoist, and D. Orban, Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming, Computational Optimization and Applications, vol.102, issue.1, pp.1-25, 2008.
DOI : 10.1007/s10589-007-9095-z
URL : https://hal.archives-ouvertes.fr/hal-00320621

P. Armand, J. Benoist, and D. Orban, From global to local convergence of interior methods for nonlinear optimization. Optimization Methods and Software, pp.1051-1080, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00920220

P. Armand and R. Omheni, A globally and quadratically convergent primal???dual augmented Lagrangian algorithm for equality constrained optimization, Optimization Methods and Software, vol.100, issue.1, p.25, 2014.
DOI : 10.1137/S1052623499355533
URL : https://hal.archives-ouvertes.fr/hal-01313701

P. Armand and R. Omheni, A mixed logarithmic barrier-augmented lagrangian algorithm for constrained optimization. En préparation, pp.2014-53
URL : https://hal.archives-ouvertes.fr/hal-01316930

A. Benchakroun, J. P. Dussault, and A. Mansouri, A two parameter mixed interior-exterior penalty algorithm, ZOR Zeitschrift f???r Operations Research Mathematical Methods of Operations Research, vol.14, 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, Mathematical Programming, vol.99, issue.1, pp.35-48, 2004.
DOI : 10.1007/s10107-003-0418-2

D. P. Bertsekas, Combined Primal-Dual and Penalty Methods for Constrained Minimization, SIAM Journal on Control, vol.13, issue.3, pp.521-544, 1975.
DOI : 10.1137/0313030

D. P. Bertsekas, On Penalty and Multiplier Methods for Constrained Minimization, SIAM Journal on Control and Optimization, vol.14, issue.2, pp.216-235, 1976.
DOI : 10.1137/0314017

D. P. Bertsekas, Approximation procedures based on the method of multipliers, Journal of Optimization Theory and Applications, vol.14, issue.4, pp.487-510, 1977.
DOI : 10.1007/BF00933293

D. P. Bertsekas, Constrained optimization and Lagrange multiplier methods, Computer Science and Applied Mathematics, vol.3, p.4, 1982.

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.
DOI : 10.1109/CDC.1973.269172

L. T. Biegler, Nonlinear programming Concepts, algorithms, and applications to chemical processes, MOS-SIAM Series on Optimization . Society for Industrial and Applied Mathematics (SIAM), vol.10, issue.9, 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. Optimization Methods Software, pp.1001-1024, 2004.

P. T. Boggs and J. W. Tolle, A Family of Descent Functions for Constrained Optimization, SIAM Journal on Numerical Analysis, vol.21, issue.6, pp.1146-1161, 1984.
DOI : 10.1137/0721071

E. Bousquet, Optimisation non linéaire et application au réglage d'un réseau de télescopes, p.22, 2009.

M. G. Breitfeld and D. F. Shanno, Preliminary Computational Experience with Modified Log-Barrier Functions for Large-Scale Nonlinear Programming, Large scale optimization, pp.45-67, 1993.
DOI : 10.1007/978-1-4613-3632-7_3

M. G. Breitfeld and D. F. Shanno, Computational experience with penalty-barrier methods for nonlinear programming, Annals of Operations Research, vol.15, issue.1, pp.439-463, 1996.
DOI : 10.1007/BF02206826

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

J. D. Buys, Dual algorithms for constrained optimization problems Doctoral dissertation, Faculty of Science, Rijksuniversiteit te Leiden, vol.3, p.4, 1972.

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

R. H. Byrd, M. E. Hribar, and J. Nocedal, An Interior Point Algorithm for Large-Scale Nonlinear Programming, SIAM Journal on Optimization, vol.9, issue.4, pp.877-900, 1999.
DOI : 10.1137/S1052623497325107

R. H. Byrd, J. Nocedal, and R. A. Waltz, Feasible interior methods using slacks for nonlinear optimization, Computational Optimization and Applications, vol.26, issue.1, pp.35-61, 2003.
DOI : 10.1023/A:1025136421370

R. H. Byrd, J. Nocedal, and R. A. Waltz, Knitro: An Integrated Package for Nonlinear Optimization, Large-scale nonlinear optimization, pp.35-59, 2006.
DOI : 10.1007/0-387-30065-1_4

R. H. Byrd, R. A. Tapia, and Y. Zhang, An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization, SIAM Journal on Optimization, vol.2, issue.2, pp.210-241, 1992.
DOI : 10.1137/0802012

L. Chen and D. Goldfarb, Interior-point ???2-penalty methods for nonlinear programming with strong global convergence properties, Mathematical Programming, vol.102, issue.1, pp.1-36, 2006.
DOI : 10.1007/s10107-005-0701-5

T. F. Coleman and C. Hempel, Computing a Trust Region Step for a Penalty Function, SIAM Journal on Scientific and Statistical Computing, vol.11, issue.1, pp.180-201, 1990.
DOI : 10.1137/0911012

A. R. Conn, N. I. Gould, D. Orban, and P. L. Toint, A primal-dual trust-region algorithm for non-convex nonlinear programming, Mathematical Programming, vol.87, issue.2, pp.215-249, 2000.
DOI : 10.1007/s101070050112

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 Journal on Numerical Analysis, vol.28, issue.2, pp.545-572, 1991.
DOI : 10.1137/0728030

A. R. Conn, N. I. Gould, and P. L. Toint, LANCELOT : A Fortran package for large-scale nonlinear optimization (release A), p.59, 1992.
DOI : 10.1007/978-3-662-12211-2

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), vol.8, p.9, 2000.
DOI : 10.1137/1.9780898719857

R. Courant, Variational methods for the solution of problems of equilibrium and vibrations, Bulletin of the American Mathematical Society, vol.49, issue.1, pp.1-23, 1943.
DOI : 10.1090/S0002-9904-1943-07818-4

F. E. Curtis, H. Jiang, and D. P. Robinson, Adaptive Augmented Lagrangian Methods for Equality Constrained Optimization, 2012.

F. E. Curtis, J. Nocedal, and A. Wächter, A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians, SIAM Journal on Optimization, vol.20, issue.3, pp.1224-1249, 2009.
DOI : 10.1137/08072471X

J. E. Cuthrell and L. T. Biegler, Augmented Lagrangian Line Searches for Successive Quadratic Programming, 1982.

G. Debreu, Definite and Semidefinite Quadratic Forms, Econometrica, vol.20, issue.2, pp.295-300, 1952.
DOI : 10.2307/1907852

J. E. Dennis, M. Heinkenschloss, and L. N. Vicente, Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems, SIAM Journal on Control and Optimization, vol.36, issue.5, pp.1750-1794, 1998.
DOI : 10.1137/S036012995279031

J. E. Dennis, J. , and R. B. Schnabel, Numerical methods for unconstrained optimization and nonlinear equations, p.76, 1983.
DOI : 10.1137/1.9781611971200

G. , D. Pillo, and L. Grippo, A new class of augmented Lagrangians in nonlinear programming, SIAM J. Control Optim, vol.17, issue.3, 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 4, pp.495-519, 1982.

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

E. D. Dolan, J. J. Moré, and T. S. Munson, Benchmarking optimization software with COPS 3.0, p.103, 2004.
DOI : 10.2172/834714

I. S. Duff, MA57---a code for the solution of sparse symmetric definite and indefinite systems, ACM Transactions on Mathematical Software, vol.30, issue.2, pp.118-144, 2004.
DOI : 10.1145/992200.992202

J. P. Dussault and A. Elafia, On the superlinear convergence order of the logarithmic barrier algorithm, Computational Optimization and Applications, vol.19, issue.1, pp.31-53, 2001.
DOI : 10.1023/A:1011220302800

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, Journal of Optimization Theory and Applications, vol.26, issue.3, pp.507-541, 1996.
DOI : 10.1007/BF02275347

D. Fernández and M. V. Solodov, Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the Second-Order Sufficient Optimality Condition, SIAM Journal on Optimization, vol.22, issue.2, pp.384-407, 2012.
DOI : 10.1137/10081085X

A. V. Fiacco and G. P. Mccormick, Nonlinear programming : Sequential unconstrained minimization techniques, p.59, 1968.
DOI : 10.1137/1.9781611971316

R. Fletcher, A class of methods for nonlinear programming with termination and convergence properties, Integer and nonlinear programming, pp.157-175, 1970.

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

R. Fletcher and S. Leyffer, Nonlinear programming without a penalty function, Mathematical Programming, vol.91, issue.2, pp.239-269, 2002.
DOI : 10.1007/s101070100244

A. Forsgren and P. E. Gill, Primal-Dual Interior Methods for Nonconvex Nonlinear Programming, SIAM Journal on Optimization, vol.8, issue.4, pp.1132-1152, 1998.
DOI : 10.1137/S1052623496305560

A. Forsgren, P. E. Gill, and M. H. Wright, Interior Methods for Nonlinear Optimization, SIAM Review, vol.44, issue.4, pp.525-597, 2002.
DOI : 10.1137/S0036144502414942

R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL : A Modeling Language for Mathematical Programming, p.99, 2002.

M. P. Friedlander and D. Orban, A primal???dual regularized interior-point method for convex quadratic programs, Mathematical Programming Computation, vol.65, issue.(3, pp.71-107, 2012.
DOI : 10.1007/s12532-012-0035-2

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

D. M. Gay, M. L. Overton, and M. A. Wright, A Primal-dual Interior Method for Nonconvex Nonlinear Programming, Advances in nonlinear programming, pp.31-56, 1996.
DOI : 10.1007/978-1-4613-3335-7_2

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

P. E. Gill, W. Murray, and M. A. 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, W. Murray, M. A. Saunders, and M. H. Wright, Some theoretical properties of an augmented Lagrangian merit function, 1986.

P. E. Gill and D. P. Robinson, A primal-dual augmented Lagrangian, Computational Optimization and Applications, vol.27, issue.3, pp.1-25, 2012.
DOI : 10.1007/s10589-010-9339-1

P. E. Gill and D. P. Robinson, A Globally Convergent Stabilized SQP Method, SIAM Journal on Optimization, vol.23, issue.4, pp.30-64, 1983.
DOI : 10.1137/120882913

T. Glad and E. Polak, A multiplier method with automatic limitation of penalty growth, Mathematical Programming, vol.12, issue.2, pp.140-155, 1979.
DOI : 10.1007/BF01588240

D. Goldfarb, R. Polyak, K. Scheinberg, and I. Yuzefovich, A modified barrieraugmented Lagrangian method for constrained minimization, Computational Optimization and Applications, vol.14, issue.1, pp.55-74, 1999.
DOI : 10.1023/A:1008705028512

N. I. Gould, On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions, IMA Journal of Numerical Analysis, vol.6, issue.3, pp.357-372, 1986.
DOI : 10.1093/imanum/6.3.357

N. I. Gould, D. Orban, A. Sartenaer, and P. L. Toint, Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming, SIAM Journal on Optimization, vol.11, issue.4, pp.974-1002, 2001.
DOI : 10.1137/S1052623400370515

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 2 8, pp.481-508, 2000.

N. I. Gould, D. Orban, and P. L. Toint, CUTEr and SifDec, ACM Transactions on Mathematical Software, vol.29, issue.4, p.103, 2001.
DOI : 10.1145/962437.962439

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, pp.353-372, 2003.
DOI : 10.1145/962437.962438

N. I. Gould, D. Orban, and P. L. Toint, Numerical methods for large-scale nonlinear optimization, Acta Numerica, vol.14, pp.299-361, 2005.
DOI : 10.1017/S0962492904000248

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

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

W. Hock and K. Schittkowski, Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, vol.187, issue.87, pp.59-103, 1981.

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.244, issue.S, pp.373-395, 1984.
DOI : 10.1007/BF02579150

M. Ko?vara and M. Stingl, PENNON: A code for convex nonlinear and semidefinite programming, Optimization Methods and Software, vol.18, issue.3, pp.317-333, 2003.
DOI : 10.1080/1055678031000098773

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, Combined Primal???Dual and Penalty Methods for Convex Programming, SIAM Journal on Control and Optimization, vol.14, issue.2, pp.268-294, 1976.
DOI : 10.1137/0314020

B. W. Kort and D. P. Bertsekas, A new penalty function method for constrained minimization, Proceedings of the 1972 IEEE Conference on Decision and Control and 11th Symposium on Adaptive Processes, pp.162-166, 2004.
DOI : 10.1109/CDC.1972.268971

S. Leyffer, Macmpec test suite, p.103

X. Liu and J. Sun, A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs, SIAM Journal on Optimization, vol.14, issue.4, pp.1163-1186, 2004.
DOI : 10.1137/S1052623402400641

X. W. Liu and J. Sun, Global Convergence Analysis of Line Search Interior-Point Methods for Nonlinear Programming without Regularity Assumptions, Journal of Optimization Theory and Applications, vol.22, issue.3, pp.609-628, 2005.
DOI : 10.1007/s10957-005-2092-4

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

H. J. Martinez, Z. Parada, and R. A. Tapia, On the characterization of Qsuperlinear convergence of quasi-Newton interior-point methods for nonlinear programming, Bol. Soc. Mat. Mexicana, vol.1, issue.32 8, pp.137-148, 1995.

J. M. Moguerza and F. J. Prieto, An augmented Lagrangian interior-point method using directions of negative curvature, Mathematical Programming, vol.95, issue.3, pp.573-616, 2003.
DOI : 10.1007/s10107-002-0360-8

W. Murray, Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions, Journal of Optimization Theory and Applications, vol.7, issue.3, pp.189-196, 1971.
DOI : 10.1007/BF00932477

B. A. Murtagh and M. A. Saunders, Minos 5.5 user's guide. report sol 83-20r, SIAM J. Optim, vol.18, issue.4 5, pp.1286-1309, 2007.

S. G. Nash, R. Polyak, and A. Sofer, A Numerical Comparison of Barrier and Modified Barrier Methods For Large-Scale Bound-Constrained Optimization, Large scale optimization, pp.319-338, 1993.
DOI : 10.1007/978-1-4613-3632-7_16

A. S. Nemirovski and M. J. Todd, Interior-point methods for optimization, Acta Numerica, vol.17, issue.7, pp.191-234, 2008.
DOI : 10.1017/S0962492906370018

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

E. Polak and A. L. Tits, A globally convergent, implementable multiplier method with automatic penalty limitation, Applied Mathematics & Optimization, vol.12, issue.6, pp.335-360, 1980.
DOI : 10.1007/BF01442901

R. Polyak, Modified barrier functions (theory and methods), Mathematical Programming, vol.12, 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, Optimization Methods and Software, vol.24, issue.3, pp.369-379, 2009.
DOI : 10.1080/10556780802699433

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

D. P. Robinson, Primal-dual methods for nonlinear optimization, Thesis (Ph.D.)?University of California, p.30, 2007.

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, New applications of duality in nonlinear programming, Proceedings of the Fourth Conference on Probability Theory, pp.73-81, 1971.

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, Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming, Mathematics of Operations Research, vol.1, issue.2, pp.97-116, 1976.
DOI : 10.1287/moor.1.2.97

K. Schittkowski, The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function, Numerische Mathematik, vol.31, issue.1, pp.83-114, 1981.
DOI : 10.1007/BF01395810

R. A. Tapia, Diagonalized multiplier methods and quasi-Newton methods for constrained optimization, Journal of Optimization Theory and Applications, vol.12, issue.2, pp.135-194, 1977.
DOI : 10.1007/BF00933161

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 Journal on Optimization, vol.14, issue.1, pp.173-199, 2003.
DOI : 10.1137/S1052623401392123

P. Tseng, Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization, SIAM Journal on Optimization, vol.13, issue.2, pp.432-469, 2002.
DOI : 10.1137/S1052623499357945

P. Tseng and D. P. Bertsekas, On the convergence of the exponential multiplier method for convex programming, Math. Programming, pp.1-19, 1993.
DOI : 10.1007/BF01580598

M. Ulbrich, S. Ulbrich, and L. N. Vicente, A globally convergent primal-dual interior-point filter method for nonlinear programming, Mathematical Programming, vol.100, issue.2, pp.379-410, 2004.
DOI : 10.1007/s10107-003-0477-4

R. J. Vanderbei and D. F. Shanno, An interior-point algorithm for nonconvex nonlinear programming Computational optimization?a tribute to Olvi Mangasarian, Part II, Computational Optimization and Applications, vol.13, issue.1/3, pp.231-252, 1999.
DOI : 10.1023/A:1008677427361

A. Wächter, An Interior Point Algorithm for Large-Scale Nonlinear Optimization with Applications in Process Engineering, p.45, 2002.

A. Wächter and L. T. Biegler, Failure of global convergence for a class of interior point methods for nonlinear programming, Mathematical Programming, vol.88, issue.3, pp.565-574, 2000.
DOI : 10.1007/PL00011386

A. Wächter and L. T. Biegler, Line Search Filter Methods for Nonlinear Programming: Local Convergence, SIAM Journal on Optimization, vol.16, issue.1, pp.32-48, 2005.
DOI : 10.1137/S1052623403426544

A. Wächter and L. T. Biegler, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Mathematical Programming, vol.10, issue.1, pp.25-57, 2006.
DOI : 10.1007/s10107-004-0559-y

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, Mathematical Programming, vol.107, issue.3, pp.391-408, 2006.
DOI : 10.1007/s10107-004-0560-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.5305

C. Wang and D. Li, Unified theory of augmented Lagrangian methods for constrained global optimization, Journal of Global Optimization, vol.11, issue.3, pp.433-458, 2009.
DOI : 10.1007/s10898-008-9347-1

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

M. A. Wright, Numerical methods for nonlinearly constrained optimization. STAN-CS, Dept. of Computer Science, issue.4, 1976.

M. A. Wright, Interior methods for constrained optimization, Acta Numerica, vol.26, issue.7, pp.341-407, 1992.
DOI : 10.1007/BF02592025

S. J. Wright, An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence, SIAM Journal on Optimization, vol.15, issue.3, pp.673-696, 2005.
DOI : 10.1137/030601235

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

H. Yamashita and H. Yabe, Superlinear and quadratic convergence of some primaldual interior point methods for constrained optimization, Math. Programming, pp.377-397, 1996.

H. Yamashita and H. Yabe, An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization, SIAM Journal on Optimization, vol.14, issue.2, pp.479-499, 2003.
DOI : 10.1137/S1052623499355533

H. Yamashita and H. Yabe, Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming, Mathematical Programming, vol.8, issue.1-2, pp.1-30, 2012.
DOI : 10.1007/s10107-010-0354-x

H. Yamashita, H. Yabe, and K. Harada, A primal???dual interior point method for nonlinear semidefinite programming, Mathematical Programming, vol.102, issue.12, pp.89-121, 2012.
DOI : 10.1007/s10107-011-0449-z

H. Yamashita, H. Yabe, and T. Tanabe, A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization, Mathematical Programming, vol.75, issue.1, pp.111-151, 2005.
DOI : 10.1007/s10107-004-0508-9