A unifying theory of exactness of linear penalty functions II: parametric penalty functions

References

• Eremin II. Penalty method in convex programming. Sov Math Dokl. 1966;8:459–462.
   Google Scholar
• Zangwill WI. Nonlinear programming via penalty functions. Manage Sci. 1967;13:344–358.
   Google Scholar
• Evans JP, Gould FJ, Tolle JW. Exact penalty functions in nonlinear programming. Math Program. 1973;4:72–97.
   Google Scholar
• Bertsekas DP. Necessary and sufficient conditions for a penalty method to be exact. Math Program. 1975;9:87–99.
   Web of Science ®Google Scholar
• Han SP, Mangasarian OL. Exact penalty functions in nonlinear programming. Math Program. 1979;17:251–269.
   Web of Science ®Google Scholar
• Di Pillo G, Grippo L. On the exactness of a class of nondifferentiable penalty functions. J Optim Theory Appl. 1988;57:399–410.
   Web of Science ®Google Scholar
• Di Pillo G, Grippo L. Exact penalty functions in constrained optimization. SIAM J Control Optim. 1989;27:1333–1360.
   Web of Science ®Google Scholar
• Di Pillo G. Exact penalty methods. In: Speedicato E, editor. Algorithms for continuous optimization: the state of the art. Boston (MA): Kluwer Academic Press; 1994. p. 209–253.
   Google Scholar
• Di Pillo G, Facchinei F. Exact barrier function methods for lipschitz programs. Appl Math Optim. 1995;32:1–31.
   Web of Science ®Google Scholar
• Rubinov AM, Yang XQ. Lagrange-type functions in constrained non-convex optimization. Dordrecht: Kluwer Academic Publishers; 2003.
   Google Scholar
• Wu ZY, Bai FS, Yang XQ, et al. An exact lower order penalty function and its smoothing in nonlinear programming. Optimization. 2004;53:51–68.
   Web of Science ®Google Scholar
• Demyanov VF. Nonsmooth optimization. In: Di Pillo G, Schoen F, editors. Nonlinear optimization. Berling: Springer-Verlag; 2010. p. 55–164. (Lecture notes in mathematics; vol. 1989).
   Google Scholar
• Zaslavski AJ. Optimization on metric and normed spaces. New York (NY): Springer Science+Business Media; 2010.
   Google Scholar
• Dolgopolik MV. A unifying theory of exactness of linear penalty functions. Optimization. 2016;65:1167–1202.
   Web of Science ®Google Scholar
• Pinar MC, Zenios SA. On smoothing exact penalty functions for convex constrained optimization. SIAM J Optim. 1994;4:486–511.
   Web of Science ®Google Scholar
• Meng Z, Dang C, Yang XQ. On the smoothing of the square-root exact penalty function for inequality constrained optimization. Comput Optim Appl. 2006;35:375–398.
   Web of Science ®Google Scholar
• Liu B. On smoothing exact penalty functions for nonlinear constrained optimization problems. J Appl Math Comput. 2009;30:259–270.
   Google Scholar
• Liuzzi G, Lucidi S. A derivative-free algorithm for inequality constrained nonlinear programming via smoothing of an ℓ∞ penalty function. SIAM J Optim. 2009;20:1–29.
   Web of Science ®Google Scholar
• Meng KW, Li SJ, Yang XQ. A robust SQP method based on a smoothing lower order penalty function. Optimization. 2009;58:23–38.
   Web of Science ®Google Scholar
• Xu X, Meng Z, Sun J, et al. A penalty function method based on smoothing lower order penalty function. J Comput Appl Math. 2011;235:4047–4058.
   Web of Science ®Google Scholar
• Lian S. Smoothing approximation to l1 exact penalty function for inequality constrained optimization. Appl Math Comput. 2012;219:3113–3121.
   Web of Science ®Google Scholar
• Xu X, Meng Z, Sun J, et al. A second-order smooth penalty function algorithm for constrained optimization problems. Comput Optim Appl. 2013;55:155–172.
   Web of Science ®Google Scholar
• Huyer W, Neumaier A. A new exact penalty function. SIAM J Optim. 2003;13:1141–1158.
   Web of Science ®Google Scholar
• Bingzhuang L, Wenling Z. A modified exact smooth penalty function for nonlinear constrained optimization. J Inequal Appl. 2012;1:173.
   Web of Science ®Google Scholar
• Wang C, Ma C, Zhou J. A new class of exact penalty functions and penalty algorithms. J Global Optim. 2014;58:51–73.
   Web of Science ®Google Scholar
• Dolgopolik MV. Smooth exact penalty functions: a general approach. Optim Lett. 2016;10:635–648.
   Web of Science ®Google Scholar
• Dolgopolik MV. Smooth exact penalty function II: a reduction to standard exact penalty functions. Optim Lett. 2016;10:1541–1560.
   Web of Science ®Google Scholar
• Yu C, Teo KL, Zhang L, et al. A new exact penalty function method for continuous inequality constrained optimization problems. J Ind Manage Optim. 2010;6:895–910.
   Web of Science ®Google Scholar
• Li B, Yu CJ, Teo KL, et al. An exact penalty function method for continuous inequality constrained optimal control problem. J Optim Theory Appl. 2011;151:260–291.
   Web of Science ®Google Scholar
• Jiang C, Lin Q, Yu C, et al. An exact penalty method for free terminal time optimal control problem with continuous inequality constraints. J Optim Theory Appl. 2012;154:30–53.
   Web of Science ®Google Scholar
• Ma C, Li X, Cedric Yiu KF, et al. New exact penalty function for solving constrained finite min–max problems. Appl Math Mech-Engl Ed. 2012;33:253–270.
   Web of Science ®Google Scholar
• Yu C, Teo KL, Bai Y. An exact penalty function method for nonlinear mixed discrete programming problems. Optim Lett. 2013;7:23–38.
   Web of Science ®Google Scholar
• Lin Q, Loxton R, Teo KL, et al. A new exact penalty method for semi-infinite programming problems. J Comput Appl Math. 2014;261:271–286.
   Web of Science ®Google Scholar
• Lin Q, Loxton R, Teo KL, et al. Optimal feedback control for dynamic systems with state constraints: an exact penalty approach. Optim Lett. 2014;8:1535–1551.
   Web of Science ®Google Scholar
• Giannessi F. Constrained optimization and image space analysis. New York (NY): Springer; 2005. (Separation of sets and optimality conditions; vol 1).
   Google Scholar
• Mastroeni G. Nonlinear separation in the image space with applications to penalty methods. Appl Anal. 2012;91:1901–1914.
   Web of Science ®Google Scholar
• Li J, Feng S, Zhang Z. A unified approach for constrained extremum problems: image space analysis. J Optim Theory Appl. 2013;159:69–92.
   Web of Science ®Google Scholar
• Zhu SK, Li SJ. Unified duality theory for constrained extremum problems. Part I: Image space analysis. J Optim Theory Appl. 2014;161:738–762.
   Web of Science ®Google Scholar
• Xu YD, Li SJ. Nonlinear separation functions and constrained extremum problems. Optim Lett. 2014;8:1149–1160.
   Web of Science ®Google Scholar
• Demyanov VF. Conditions for an extremum in metric spaces. J Global Optim. 2000;17:55–63.
   Web of Science ®Google Scholar
• Ioffe AD. Metric regularity and subdifferential calculus. Russ Math Surv. 2000;55:501–558.
   Web of Science ®Google Scholar
• Azé DA. Unified theory for metric regularity of multifunctions. J Convex Anal. 2006;13:225–252.
   Web of Science ®Google Scholar
• Giannessi F. Semidifferentiable functions and necessary optimality conditions. J Optim Theory Appl. 1989;60:191–240.
   Web of Science ®Google Scholar
• Uderzo A. Exact penalty functions and calmness for mathematical programming under nonlinear perturbations. Nonlinear Anal. 2010;73:1596–1609.
   Web of Science ®Google Scholar
• Ye JJ. The exact penalty principle. Nonlinear Anal. 2012;75:1642–1654.
   Web of Science ®Google Scholar
• Lian S, Zhang L. A simple smooth exact penalty function for smooth optimization problem. J Syst Sci Complex. 2012;25:521–528.
   Web of Science ®Google Scholar
• Rubinov AM, Huang XX, Yang XQ. The zero duality gap property and lower semicontinuity of the perturbation function. Math Oper Res. 2002;27:775–791.
   Web of Science ®Google Scholar
• Fiacco A, McCormic G. Nonlinear programming: sequential unconstrained minimization techniques. New York (NY): Wiley; 1968.
   Google Scholar
• Auslender A, Cominetti R, Haddou M. Asymptotic analysis for penalty and barrier methods in convex and linear programming. Math Oper Res. 1997;22:43–62.
   Web of Science ®Google Scholar
• Ben-Tal A, Zibulevsky M. Penalty/barrier multiplier methods for convex programming problems. SIAM J Optim. 1997;7:347–366.
   Web of Science ®Google Scholar
• Auslender A. Penalty and barrier methods: a unified framework. SIAM J Optim. 1999;10:211–230.
   Web of Science ®Google Scholar
• Kruger AY. Error bounds and metric subregularity. Optimization. 2015;64:49–79.
   Web of Science ®Google Scholar
• Borwein JM, Zhu QJ. Techniques of variational analysis. New York (NY): Springer; 2005.
   Google Scholar
• Rockafellar RT, Wets RJB. Variational analysis. New York (NY): Springer-Verlag; 1998.
   Google Scholar
• Xu S. Smoothing method for minimax problems. Comput Optim Appl. 2001;20:267–279.
   Web of Science ®Google Scholar