Abstract
Bundle methods have been well studied in nonsmooth optimization. In most of the bundle methods developed thus far (traditional bundle methods), at least one quadratic programming subproblem needs to be solved in each iteration. In this paper, a simple version of bundle method with linear programming is proposed. In each iteration, a cutting-plane model subject to a constraint constructed by an infinity norm is minimized. Without line search or trust region techniques, the convergence of the method can be shown. Additionally, the infinity norm in the constraint can be generalized to $$p$$ -norm. Preliminary numerical experiments show the potential advantage of the proposed method for solving large scale problems.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
