A New Smoothing Nonlinear Penalty Function for Constrained Optimization
AbstractIn this study, a new smoothing nonlinear penalty function for constrained optimization problems is presented. It is proved that the optimal solution of the smoothed penalty problem is an approximate optimal solution of the original problem. Based on the smoothed penalty function, we develop an algorithm for finding an optimal solution of the optimization problems with inequality constraints. We further discuss the convergence of this algorithm and test this algorithm with three numerical examples. The numerical examples show that the proposed algorithm is feasible and effective for solving some nonlinear constrained optimization problems. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Yang, T.; Binh, N.T.; Thang, T.M.; Hoa, D.T. A New Smoothing Nonlinear Penalty Function for Constrained Optimization. Math. Comput. Appl. 2017, 22, 31.
Yang T, Binh NT, Thang TM, Hoa DT. A New Smoothing Nonlinear Penalty Function for Constrained Optimization. Mathematical and Computational Applications. 2017; 22(2):31.Chicago/Turabian Style
Yang, Touna; Binh, Nguyen T.; Thang, Tran M.; Hoa, Duong T. 2017. "A New Smoothing Nonlinear Penalty Function for Constrained Optimization." Math. Comput. Appl. 22, no. 2: 31.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.