|  A. Auslender, R. Cominetti and M. Haddou, Asymptotic analysis of penalty and barrier methods in convex and linear programming, Mathematics of Operations Research, 22(1997), 43-62. A. Ben-Tel and M. Zibulevsky, Penalty/barrier multiplier methods for convex programming problems, SIAM Journal on Optimization, 7(2)(1997), 347-366. D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982. D.P. Bertsekas, Nonlinear Programming, 2nd ed., Athena Scientific, Belmont, Massachusetts, 1999. C. Charalambous, Nonliear least pth optimization and nonlinear programming, Mathematical Programming, 12(1977), 195-225. D. Goldfarb, R. Polyak, K. Scheinberg and I. Yuzeforich, A modified barrier-augmented Lagrangian method for constrained minimization, Computational Optimization and Applications, 14(1999), 55-74. J.P. Dussault, Augmented non-quadratic penalty algorithms, Mathematical Programming, 99(2004), 467-486. I. Griva and R.A. Polyak, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, Mathematical Programming, 106(2)(2006), 237C259 . M.R. Hestenes, Multiplier and gradient method, Journal on Optimization Theory and Applications, 4(1969), 303-320. C. Kanzow and H. Kleinmichel, A new class of semismooth Newton-type methods for nonlinear complementarity Problems, Computational Optimization and Applications, 11(1998), 227-251. D. Li, Zero duality gap for a class of nonconvex optimization problems, Journal of Optimization Theory and Applications, 85(1995), 309-323. L. Lukšan and J. Vlcek, Test problems for nonsmooth unconstrained and linearly constrained optimization, Technical Report 798(2000), Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague. O.L. Mangasarian, Unconstrained Lagrangians in nonlinear programming, SIAM Journal on Control, 13(1975), 772-791. R.A. Polyak, Modified barrier function: theory and mehtods, Mathematical Programming, 54(1992), 177-222. R.A. Polyak, Log-Sigmoid multipliers method in constrained optimization, Annals of operations Research, 101(2001), 427-460. R.A. Polyak, Nonlinear rescaling vs. smoothing technique in convex optimization, Mathematical Programming, 92(2002), 197-235. R.A. Polyak and I. Griva, Primal-Dual nonlinear rescaling method for convex optimization, Journal of Optimization Theory and Applications, 122(2004), 111-156. R.A. Polyak and M. Teboulle, Nonlinear rescaling and classical-like methods in convex optimization, Mathematical Programming , 76(1997), 265-284. M.J.D. Powell, A method for nonlinear constraints in minimization problems, In Optimization (R. Fletcher, ed.), Academic Press, New York, 283-298, 1969. Y.H. Ren, L.W. Zhang and X.T. Xiao, A nonlinear Lagrangian based on Fischer-Burmeister NCP function. Applied Mathematics and Computation, 188(2007), 1344-1363. R.T. Rockafellar, A dual approach to solving nonlinear programming problems by unconstrained optimization, Mathematical programming, 5(1973), 354-373. R.T. Rockafellar, The multiplier method of Hestenes and Powell applied to convex programming, Journal of Optimization Theory and Applications, 12(1973), 555-562. R.T. Rockafellar, Augmented Lagrange multiplier functions and duality in nonconvex programming, SIAM Journal on Control, 12(1974), 268-285. L.W. Zhang, Y.H. Ren, Y. Wu and X.T. Xiao, A class of nonlinear Lagrangians: theory and algorithm, Asia-Pacific Journal of Operational Research, 25:3 (2008), 327-371.