scholarly journals Smoothing Approximation to the Square-Root Exact Penalty Function

2016 ◽  
Vol 4 (1) ◽  
pp. 87-96
Author(s):  
Yaqiong Duan ◽  
Shujun Lian

AbstractIn this paper, smoothing approximation to the square-root exact penalty functions is devised for inequality constrained optimization. It is shown that an approximately optimal solution of the smoothed penalty problem is an approximately optimal solution of the original problem. An algorithm based on the new smoothed penalty functions is proposed and shown to be convergent under mild conditions. Three numerical examples show that the algorithm is efficient.

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Shujun Lian ◽  
Jinli Han

A method is proposed to smooth the square-order exact penalty function for inequality constrained optimization. It is shown that, under some conditions, an approximately optimal solution of the original problem can be obtained by searching an approximately optimal solution of the smoothed penalty problem. An algorithm based on the smoothed penalty functions is given. The algorithm is shown to be convergent under mild conditions. Two numerical examples show that the algorithm seems efficient.


Author(s):  
Jing Qiu ◽  
Jiguo Yu ◽  
Shujun Lian

In this paper, we propose a new non-smooth penalty function with two parameters for nonlinear inequality constrained optimization problems. And we propose a twice continuously differentiable function which is smoothing approximation to the non-smooth penalty function and define the corresponding smoothed penalty problem. A global solution of the smoothed penalty problem is proved to be an approximation global solution of the non-smooth penalty problem. Based on the smoothed penalty function, we develop an algorithm and prove that the sequence generated by the algorithm can converge to the optimal solution of the original problem.


2018 ◽  
Vol 50 (1) ◽  
pp. 37-60 ◽  
Author(s):  
Binh Thanh Nguyen ◽  
Yanqin Bai ◽  
Xin Yan ◽  
Touna Yang

In this paper, we propose two new smoothing approximation to the lower order exact penalty functions for nonlinear optimization problems with inequality constraints. Error estimations between smoothed penalty function and nonsmooth penalty function are investigated. By using these new smooth penalty functions, a nonlinear optimization problem with inequality constraints is converted into a sequence of minimizations of continuously differentiable function. Then based on each of the smoothed penalty functions, we develop an algorithm respectively to finding an approximate optimal solution of the original constrained optimization problem and prove the convergence of the proposed algorithms. The effectiveness of the smoothed penalty functions is illustrated through three examples, which show that the algorithm seems efficient.


Sign in / Sign up

Export Citation Format

Share Document