Proximal bundle method has usually been presented for unconstrained convex optimization problemsï¿½??. ï¿½??In this paperï¿½??, ï¿½??we develop an infeasible proximal bundle method for nonsmooth nonconvex constrained optimization problemsï¿½??. ï¿½??Using the improvement function we transform the problem into an unconstrained one and then we build a cutting plane modelï¿½??. ï¿½??The resulting algorithm allows effective control of the size of quadraaccumulation point of the iterative sequence is stationary for the improvement functionï¿½??. ï¿½??At the endï¿½??, ï¿½??some encouraging numerical results with a MATLAB implementation are also reportedï¿½??.tic programming subproblems via the aggregation techniquesï¿½??. ï¿½??The novelty in our approach is that the objective and constraint functions can be any arbitrary (regular) locally Lipschitz functionsï¿½??.
Download TeX format
