On Smoothing l₁ Exact Penalty Function for Constrained Optimization Problems

References

• Yu, J., Li, M., Wang, Y., He, G. (2014). A decomposition method for large-scale box constrained optimization. Appl. Math. Comput. 231(12):9–15.
   Google Scholar
• Han, C. Y., Zheng, F. Y., Guo, T. D., He, G. P. (2014). Parallel algorithms for large-scale linearly constrained minimization problem. Acta Math. Appl. Sin. Engl. Ser. 30(3):707–720. doi: 10.1007/s10255-013-0300-9
   Web of Science ®Google Scholar
• Tang, J. Y., He, G. P., Dong, L., Fang, L., Zhou, J. C. (2013). A smoothing newton method for the second-order cone complementarity problem. Appl. Math. Math. 58(2):223–247. doi: 10.1007/s10492-013-0011-9
   Web of Science ®Google Scholar
• Han, C. Y., Feng, T. T., He, G. P., Guo, T. D. (2013). Parallel variable distribution algorithm for constrained optimization with nonmonotone technique. J. Appl. Math. 2013:295147.
   Web of Science ®Google Scholar
• Tang, J. Y., He, G. P., Fang, L. (2013). A new non-interior continuation method for second-order cone programming. J. Numer. Math. 21(4):301–323.
   Web of Science ®Google Scholar
• Li, G. L., Zhang, W. H. (2013). Study on indefinite stochastic linear quadratic optimal control with inequality constraint. J. Appl. Math. 2013:805829.
   Web of Science ®Google Scholar
• Hongli, Y. (2013). Study on stochastic linear quadratic optimal control with quadratic and mixed terminal state constraints. J. Appl. Math. 2013:674327. doi: 10.1155/2013/674327
   Web of Science ®Google Scholar
• Sun, L., He, G., Wang, Y., Zhou, C. (2011). An accurate active set newton algorithm for large scale bound constrained optimization. Appl. Math. 56(3):297–314. doi: 10.1007/s10492-011-0018-z
   Web of Science ®Google Scholar
• Lian, S. J., Duan, Y. Q. (2016). Smoothing of the lower-order exact penalty function for inequality constrained optimization. J. Inequal. Appl. 2016:185.
   Web of Science ®Google Scholar
• Zheng, F., Han, C., Wang, Y. (2011). Parallel SSLE algorithm for large scale constrained optimization. Appl. Math. Comput. 217(12):5377–5384.
   Web of Science ®Google Scholar
• Han, C., Wang, Y., He, G. (2009). On the convergence of asynchronous parallel algorithm for large-scale linearly constrained minimization problem. Appl. Math. Comput. 211(2):434–441.
   Web of Science ®Google Scholar
• Sun, L., He, G. P., Wang, Y. L., Fang, L. (2009). An active set quasi-Newton method with projected search for bound constrained minimization. Comput. Math. Appl. 58(1):161–170. doi: 10.1016/j.camwa.2009.03.085
   Web of Science ®Google Scholar
• Lian, S. J., Zhang, L. S. (2012). A simple smooth exact penalty function for smooth optimization problem. J. Syst. Sci. Complex. 25(3):521–528. doi: 10.1007/s11424-012-9226-1
   Web of Science ®Google Scholar
• Zangwill, W. I. (1967). Nonlinear programming via penalty function. Manage. Sci. 13(5):344–358. doi: 10.1287/mnsc.13.5.344
   Google Scholar
• Tang, J. Y., He, G. P., Dong, L., Fang, L. (2012). A new one-step smoothing Newton method for second-order cone programming. Appl. Math. 57(4):311–331. doi: 10.1007/s10492-012-0019-6
   Web of Science ®Google Scholar
• Zhu, J., Hao, B. (2013). A new class of smoothing functions and a smoothing Newton method for complementarity problems. Optim. Lett. 7(3):481–497. doi: 10.1007/s11590-011-0432-x
   Web of Science ®Google Scholar
• Chen, H. B., Chen, Y. N., Li, G. Y., Qi, L. Q. (2018). A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test. Numer. Linear Algebra Appl. 25(1):e2125. doi: 10.1002/nla.2125
   Web of Science ®Google Scholar
• Wang, G., Yang, X. Q., Cheng, T. C. E. (2013). Generalized levitin-polyak well-posedness for generalized semi-infinite programs. Numer. Funct. Anal. Optim. 34(6):695–711. doi: 10.1080/01630563.2012.717333
   Web of Science ®Google Scholar
• Huang, X. X., Yang, X. Q. (2001). Duality and exact penalization for vector optimization via augmented lagrangian. J. Optim. Theory Appl. 111(3):615–640. doi: 10.1023/A:1012654128753
   Web of Science ®Google Scholar
• Yang, X. Q., Huang, X. X. (2001). A nonlinear lagrangian approach to constrained optimization problems. SIAM J. Optim. 11(4):1119–1144. doi: 10.1137/S1052623400371806
   Web of Science ®Google Scholar
• Chen, C. H., Mangasarian, O. L. (1995). Smoothing methods for convex inequalities and linear complementarity problems. Math. Program. 71(1):51–69. doi: 10.1007/BF01592244
   Web of Science ®Google Scholar
• Rubinov, A. M., Glover, B. M., Yang, X. Q. (1999). Extended Lagrange and penalty functions in continuous optimization. Optimization 46(4):327–351. doi: 10.1080/02331939908844460
   Google Scholar
• Rubinov, A. M., Glover, B. M., Yang, X. Q. (1999). Decreasing functions with applications to penalization. SIAM J. Optim. 10(1):289–313. doi: 10.1137/S1052623497326095
   Web of Science ®Google Scholar
• Meng, K. W., Li, S. J., Yang, X. Q. (2009). A robust SQP method based on a smoothing lower order penalty function. Optimization 58(1):23–38. doi: 10.1080/02331930701761193
   Web of Science ®Google Scholar
• Wu, Z. Y., Bai, F. S., Yang, X. Q., Zhang, L. S. (2004). An exact lower order penalty functions and its smoothing in nonlinear programming. Optimization 53(1):51–68. doi: 10.1080/02331930410001662199
   Web of Science ®Google Scholar
• Yang, X. Q., Meng, Z. Q., Huang, X. X., Pong, G. T. Y. (2003). Smoothing nonlinear penalty functions for constrained optimization problems. Numer. Funct. Anal. Optim. 24(3–4):351–364. doi: 10.1081/NFA-120022928
   Web of Science ®Google Scholar
• Meng, Z. Q., Hu, Q. Y., Dang, C. Y. (2009). A penalty function algorithm with objective parameters for nonlinear mathematical programming. JIMO J. Ind. Manag. Optim. 5(3):585–601.
   Web of Science ®Google Scholar
• Lian, S. J., Han, J. L. (2013). Smoothing approximation to the square-order exact penalty functions for constrained optimization. J. Appl. Math. 2013:568316.
   Web of Science ®Google Scholar
• Li, Y. Y., Tan, T., Li, X. S. (2012). A log-exponential smoothing method for mathematical programs with complementarity constraints. Appl. Math. Comput. 218(10):5900–5909.
   Web of Science ®Google Scholar
• Tang, J. Y., He, G. P., Dong, L., Fang, L. (2011). A smoothing Newton method for second-order cone optimization based on a new smoothing function. Appl. Math. Comput. 218(4):1317–1329.
   Web of Science ®Google Scholar
• Meng, Z. Q., Dang, C. Y., Yang, X. Q. (2006). On the smoothing of the square-root exact penalty function for inequality constrained optimization. Comput. Optim. Appl. 35(3):375–398. doi: 10.1007/s10589-006-8720-6
   Web of Science ®Google Scholar
• Dolgopolik, M. V. (2016). Smooth exact penalty functions II: a reduction to standard exact penalty functions. Optim. Lett. 10(7):1541–1560. doi: 10.1007/s11590-015-0961-9
   Web of Science ®Google Scholar
• Sahiner, A., Kapusuz, G., Yilmaz, N. (2016). A new smoothing approach to exact penalty functions for inequality constrained optimization problems. Naco. Numer. Algebra Control Optim. 6(2):161–173. doi: 10.3934/naco.2016006
   Web of Science ®Google Scholar
• Xu, X. S., Meng, Z. Q., Sun, J. W., Huang, L. G., Shen, R. (2013). A second-order smooth penalty function algorithm for constrained optimization problems. Comput. Optim. Appl. 55(1):155–172. doi: 10.1007/s10589-012-9504-9
   Web of Science ®Google Scholar
• Xu, X. S., Meng, Z. Q., Sun, J. W., Shen, R. (2011). A penalty function method based on smoothing lower order penalty function. J. Comput. Appl. Math. 235(14):4047–4058. doi: 10.1016/j.cam.2011.02.031
   Web of Science ®Google Scholar
• Lian, S. J. (2012). Smoothing approximation to l1 exact penalty function for inequality constrained optimization. Appl. Math. Comput. 219(6):3113–3121.
   Web of Science ®Google Scholar