On smoothing exact penalty functions for nonlinear constrained optimization problems

Journal of Applied Mathematics and Computing

Volumn 30, Issue 1-2, 2009, Pages 259-270

  Liu, Bingzhuang ^a,b  

^a SHANGHAI UNIVERSITY   (China)

^b SHANDONG UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Constrained optimization; Exact penalty function; Optimal solution; Smoothing method

Indexed keywords

EID: 63949086771     PISSN: 15985865     EISSN: None     Source Type: Journal    
DOI: 10.1007/s12190-008-0171-z     Document Type: Article

References (10)

1. 1. A. Auslender R. Cominetti M. Haddou 1997 Asymptotic analysis for penalty and barrier methods in convex and linear programming Math. Oper. Res. 22 43 62 0872.90067 10.1287/moor.22.1.43 1436573 Auslender, A., Cominetti, R., Haddou, M.: Asymptotic analysis for penalty and barrier methods in convex and linear programming. Math. Oper. Res. 22, 43–62 (1997)
2. 2. A. Ben-tal M. Teboulle 1989 A smoothing technique for non-differentiable optimization problems Lecture Notes in Mathematics Springer Berlin Ben-tal, A., Teboulle, M.: A smoothing technique for non-differentiable optimization problems. In: Lecture Notes in Mathematics. Springer, Berlin (1989)
3. 3. C. Chen O.L. Mangasarian 1995 Smoothing methods for convex inequalities and linear complementarity problems Math. Program. 71 51 69 10.1007/BF01592244 1362957 Chen, C., Mangasarian, O.L.: Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71, 51–69 (1995)
4. 4. C. Chen O.L. Mangasarian 1996 A class of smoothing functions for nonlinear and mixed complementary problems Comput. Optim. Appl. 5 97 138 0859.90112 10.1007/BF00249052 1373293 Chen, C., Mangasarian, O.L.: A class of smoothing functions for nonlinear and mixed complementary problems. Comput. Optim. Appl. 5, 97–138 (1996)
5. 5. C.C. Gonzaga R.A. Castillo 2003 A nonlinear programming algorithm based on non-coercive penalty functions Math. Program. 96 87 101 1023.90061 10.1007/s10107-002-0332-z 1974168 Gonzaga, C.C., Castillo, R.A.: A nonlinear programming algorithm based on non-coercive penalty functions. Math. Program. 96, 87–101 (2003)
6. 6. Z.Q. Meng C.Y. Dang X.Q. Yang 2006 On the smoothing of the square-root exact penalty function for inequality constrained optimization Comput. Optim. Appl. 35 375 398 1128.90055 10.1007/s10589-006-8720-6 2279497 Meng, Z.Q., Dang, C.Y., Yang, X.Q.: On the smoothing of the square-root exact penalty function for inequality constrained optimization. Comput. Optim. Appl. 35, 375–398 (2006)
7. 7. M.C. Pinar S.A. Zenios 1994 On smoothing exact penalty functions for convex constrained optimization SIAM J. Optim. 4 486 511 0819.90072 10.1137/0804027 1287812 Pinar, M.C., Zenios, S.A.: On smoothing exact penalty functions for convex constrained optimization. SIAM J. Optim. 4, 486–511 (1994)
8. 8. Z.Y. Wu F.S. Bai X.Q. Yang L.S. Zhang 2004 An exact lower order penalty function and its smoothing in nonlinear programming Optimization 53 51 68 1079.90130 10.1080/02331930410001662199 2040634 Wu, Z.Y., Bai, F.S., Yang, X.Q., Zhang, L.S.: An exact lower order penalty function and its smoothing in nonlinear programming. Optimization 53, 51–68 (2004)
9. 9. I. Zang 1980 A smoothing-out technique for min-max optimization Math. Program. 19 61 77 0468.90064 10.1007/BF01581628 579403 Zang, I.: A smoothing-out technique for min-max optimization. Math. Program. 19, 61–77 (1980)
10. 10. W.I. Zangwill 1967 Nonlinear programming via penalty function Manag. Sci. 13 334 358 Zangwill, W.I.: Nonlinear programming via penalty function. Manag. Sci. 13, 334–358 (1967)