On Smoothing l1 Exact Penalty Function for Nonlinear Constrained Optimization Problems

Expand
  • School of Mathematics and Statistics, Henan University of Science and Technology, Luoyang 471023, Henan, China

Received date: 2023-12-29

  Revised date: 2024-08-27

  Online published: 2026-07-06

Supported by

You-Lin Shang’ work was supported by the National Natural Science Foundation of China (Nos.11471102 and 12071112) and Basic Research Projects for Key Scientific Research Projects of Henan Projects of China (No.20ZX001).

Abstract

The penalty function method is a significant method for solving nonlinear constrained optimization problems (COP). In this paper, a new quadratic continuous differentiable smooth penalty function is proposed for the l1 exact penalty function. The error estimations between the objective function values of the smooth penalty problem, the penalty problem and the original problem are also studied. Furthermore, based on the smoothed penalty function, an algorithm for solving COP is proposed, and the convergence of the algorithm is proved. Finally, several numerical examples are given to illustrate the effectiveness of the proposed algorithm.

Cite this article

Yu-Fei Ren, You-Lin Shang . On Smoothing l1 Exact Penalty Function for Nonlinear Constrained Optimization Problems[J]. Journal of the Operations Research Society of China, 2026 , 14(2) : 700 -718 . DOI: 10.1007/s40305-024-00566-9

References

[1] Binh, N.: Smoothing approximation to l] exact penalty function for constrained optimization prob- lems.J. Appl. Math. Inform.33(3-4),387-399(2015)
[2] Cheng, M. A new exact penalty function method for nonlinear programming problems. ScienceeAsia 44(4), 268-276(2018)
[3] Chen, X.: Smoothing methods for nonsmooth, nonconvex minimization. Math. Program. 134, 71-99(2012)
[4] Dolgopolik, Maksim V. Smooth exact penalty functions: a general approach. Optim. Lett. 10(3), 635-648(2016)
[5] Dolgopolik, Maksim V.: Smooth exact penalty functions II: a reduction to standard exact penalty functions. Optim. Lett.10(7),1541-1560(2016)
[6] Huang, X.,Yang, X., Teo, K.:Convergence analysis of a class of penalty methods for vector opti- mization problems with cone constraints. J. Global. Optim. 36(4), 637-652(2006)
[7] He, Z., Bai, F.: A smoothing approximation to the lower order exact penalty function. Oper. Res. Trans. 14(2), 11–22(2010)
[8] Huyer, W., Neumaier, A.: A new exact penalty function. SIAM J. Optim. 13, 1141–1158(2003)
[9] Liu, B.: On smoothing exact penalty functions for nonlinear constrained optimization problems. J. Appl. Math. Comput. 30, 259–270(2009)
[10] Liu, B.: A new family of smoothing exact penalty functions for the constrained optimization problem. Eng. Let. 29(3), 1–6(2021)
[11] Liu, Q., Xu, Y., Zhou, Y.: A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems. J. Glob. Optim. 76, 745–768(2020)
[12] Lian, S.: Smoothing approximation to l1 exact penalty function for inequality constrained optimization. Appl. Math. Comput. 219(6), 3113–3121(2012)
[13] Lian, S., Niu, N.: Smoothing approximation to the lower order exact penalty function for inequality constrained optimization. J. Inequal. Appl. 131, 1–12(2018)
[14] Luo, Z., Pang, J., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)
[15] Meng, Z., Dang, C., Jiang, M., Shen, R.: A smoothing objective penalty function algorithm for inequality constrained optimization problems. Numer. Funct. Anal. Optim. 32(7), 806–820(2011)
[16] Meng,Z.,Dang,C.,Yang,X.:Onthesmoothingofthesquare-rootexactpenaltyfunctionforinequality constrained optimization. Comput. Optim. Appl. 35, 375–398(2006)
[17] Pinar, M., Zenios, S.: On smoothing exact penalty functions for convex constrained optimization. SIAM J. Optim. 4(3), 486–511(1994)
[18] Qiu, J., Yu, J., Lian, S.: Smoothing approximation to the new exact penalty function with two parameters. Asia. Pac. J. Oper. Res. 38(5), 1–19(2021)
[19] Rubinov, A., Yang, X., Bagirov, A.: Penalty functions with a small penalty parameter. Optim. Method. Softw. 17(5), 931–964(2002)
[20] Sahiner, A., Kapusuz, G., Yilmaz, N.: A new smoothing approach to exact penalty functions for inequality constrained optimization problems. Numer. Algebr. Control. 6(2), 161–173(2016)
[21] Wu, Z., et al.: An exact lower order penalty function and its smoothing in nonlinear programming. Optimization 53, 51–68(2004)
[22] Wu, Z., Lee, H., Bai, F.: Quadratic smoothing approximation to l1 exact penalty function in global optimization. J. Ind. Manag. Optim. 1(4), 533–547(2005)
[23] Xu, X., Dang, C.: On smoothing l1 exact penalty function for constrained optimization problems. Numer. Funct. Anal. Optim. 40, 1–18(2019)
[24] Xu, X., Meng, Z., Sun, J.: A second-order smooth penalty function algorithm for constrained optimization problems. Comput. Optim. Appl. 55(1), 155–172(2013)
[25] Yang, X., Meng, Z., Huang, X., Pong, G.: Smoothing nonlinear penalty functions for constrained optimization problems. Numer. Funct. Anal. Optim. 24(3–4), 351–364(2003)
[26] Zangwill, W.: Nonlinear programming via penalty function. Manag. Sci. 13(5), 344–358(1967)
Options
Outlines

/