A reduction method for nonlinear semi-infinite programming based on an exact penalty technique

2016 ◽  
Vol 9 (3) ◽  
pp. 348
Author(s):  
Alzira Mota ◽  
A. Ismael F. Vaz
Author(s):  
Xiaoliang Wang ◽  
Liping Pang ◽  
Qi Wu

The bundle modification strategy for the convex unconstrained problems was proposed by Alexey et al. [[2007] European Journal of Operation Research, 180(1), 38–47.] whose most interesting feature was the reduction of the calls for the quadratic programming solver. In this paper, we extend the bundle modification strategy to a class of nonconvex nonsmooth constraint problems. Concretely, we adopt the convexification technique to the objective function and constraint function, take the penalty strategy to transfer the modified model into an unconstrained optimization and focus on the unconstrained problem with proximal bundle method and the bundle modification strategies. The global convergence of the corresponding algorithm is proved. The primal numerical results show that the proposed algorithms are promising and effective.


1987 ◽  
Vol 37 (1) ◽  
pp. 19-40 ◽  
Author(s):  
Andrew R. Conn ◽  
Nicholas I. M. Gould

2014 ◽  
Vol 261 ◽  
pp. 271-286 ◽  
Author(s):  
Qun Lin ◽  
Ryan Loxton ◽  
Kok Lay Teo ◽  
Yong Hong Wu ◽  
Changjun Yu

2012 ◽  
Vol 8 (3) ◽  
pp. 705-726 ◽  
Author(s):  
Cheng Ma ◽  
Xun Li ◽  
Ka-Fai Cedric Yiu ◽  
Yongjian Yang ◽  
Liansheng Zhang

Optimization ◽  
2009 ◽  
Vol 58 (6) ◽  
pp. 713-726 ◽  
Author(s):  
Ana I.P.N. Pereira ◽  
Edite M.G.P. Fernandes

2019 ◽  
Vol 7 (1) ◽  
pp. 256-259
Author(s):  
P.Balasowandari ◽  
Dr. V.Anusuya

Sign in / Sign up

Export Citation Format

Share Document