×

A new smoothing approach to exact penalty functions for inequality constrained optimization problems. (English) Zbl 1346.90770

Summary: In this study, we introduce a new smoothing approximation to the non-differentiable exact penalty functions for inequality constrained optimization problems. Error estimations are investigated between non-smooth penalty function and smoothed penalty function. In order to demonstrate the effectiveness of proposed smoothing approach the numerical examples are given.

MSC:

90C30 Nonlinear programming
57R12 Smooth approximations in differential topology
53C35 Differential geometry of symmetric spaces
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] A. M. Bagirov, Hyperbolic smoothing functions for nonsmooth minimization,, Optimization, 62, 759 (2013) · Zbl 1282.65065 · doi:10.1080/02331934.2012.675335
[2] F. S. Bai, Lower order calmness and exact penalty fucntion,, Optimization Methods ans Software, 21, 515 (2006) · Zbl 1113.49034 · doi:10.1080/10556780600627693
[3] A. Ben-Tal, Smoothing technique for nondifferentiable optimization problems,, Lecture notes in mathematics, 1 (1989) · Zbl 0683.90078
[4] D. Bertsekas, Nondifferentiable optimization via approximation,, Mathematical Programming Study, 3, 1 (1975) · Zbl 0383.49025
[5] C. Chen, A Class of smoothing functions for nonlinear and mixed complementarity problem,, Computational Optimization and Application, 5, 97 (1996) · Zbl 0859.90112 · doi:10.1007/BF00249052
[6] X. Chen, Smoothing Methods for nonsmooth, nonconvex minimzation,, Mathematical Programming Serie B, 134, 71 (2012) · Zbl 1266.90145 · doi:10.1007/s10107-012-0569-0
[7] S. J. Lian, Smoothing approximation to <I>l</I><SUB><I>1</I></SUB> exact penalty for inequality constrained optimization,, Applied Mathematics and Computation, 219, 3113 (2012) · Zbl 1309.90103 · doi:10.1016/j.amc.2012.09.042
[8] B. Liu, On smoothing exact penalty function for nonlinear constrained optimization problem,, Journal of Applied Mathematics and Computing, 30, 259 (2009) · Zbl 1178.90315 · doi:10.1007/s12190-008-0171-z
[9] M. C. Pinar, On smoothing exact penalty functions for convex constrained optimization,, SIAM Journal on Optimization, 4, 468 (1994) · Zbl 0819.90072 · doi:10.1137/0804027
[10] Z. Meng, A smoothing objective penalty function algorithm foe inequality constrained optimization problems,, Numerical Functional Analysis and Optimization, 32, 806 (2011) · Zbl 1227.65051 · doi:10.1080/01630563.2011.577262
[11] Z. Y. Wu, Quadratic smoothing approximation to <I>l</I><SUB><I>1</I></SUB> exact penalty function in global optimization,, Journal of Industrail and Management Optimization, 53, 533 (2005) · Zbl 1127.90409 · doi:10.3934/jimo.2005.1.533
[12] Z. Y. Wu, An exact lower orderpenalty function and its smoothing in nonlinear programming,, Optimization, 53, 51 (2004) · Zbl 1079.90130 · doi:10.1080/02331930410001662199
[13] A. E. Xavier, The hyperbolic smoothing clustering method,, Pattern Recognition, 43, 731 (2010) · Zbl 1187.68514
[14] A. E. Xavier, Optimal covering of plane domains by circles via hyperbolic smoothing,, Journal of Global Optimization, 31, 493 (2005) · Zbl 1093.90023 · doi:10.1007/s10898-004-0737-8
[15] X. Xu, A penalty function method based on smoothing lower order penalty function,, Journal of Computational and Applied Mathematics, 235, 4047 (2011) · Zbl 1221.65150 · doi:10.1016/j.cam.2011.02.031
[16] N. Yilmaz, A New Global Optimization Technique Based on the Smoothing Approach for Non-smooth, Non-convex Optimization,, Submitted.
[17] N. Yilmaz, Smoothing Approach for Non-lipschitz Optimization,, Submitted.
[18] I. Zang, A smooting out technique for min-max optimization,, Mathematical Programming, 19, 61 (1980) · Zbl 0468.90064 · doi:10.1007/BF01581628
[19] W. I. Zangwill, Nonlinear programing via penalty functions,, Management Science, 13, 344 (1967) · Zbl 0171.18202
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.