On the Smoothing of the Square-Root Exact Penalty Function for Inequality Constrained Optimization
In this paper we propose two methods for smoothing a nonsmooth square-root exact penalty function for inequality constrained optimization. Error estimations are obtained among the optimal objective function values of the smoothed penalty problem, of the nonsmooth penalty problem and of the original optimization problem. We develop an algorithm for solving the optimization problem based on the smoothed penalty function and prove the convergence of the algorithm. The efficiency of the smoothed penalty function is illustrated with some numerical examples, which show that the algorithm seems efficient.
Keywordsconstrained optimization penalty function exact penalty function smoothing method ∈-feasible solution, optimal solution
Unable to display preview. Download preview PDF.
- 1.W.I. Zangwill, “Nonlinear programming via penalty function,” Manangement Science, vol. 13, pp. 334–358, 1967.Google Scholar
- 5.F.H. Clarke, Optimization and Nonsmooth Analysis, Wiley, New York, 1982.Google Scholar
- 13.S.C. Fang, J.R. Rajasekera, and H.S.J. Tsao, Entropy Optimization and Mathematical Proggramming, Kluwer, 1997.Google Scholar