Abstract
We consider the target radius method of A. Ouorou (2009) and propose some extensions to handle particular classes of (a) nonsmooth convex (nonlinearly) constrained optimization problems; (b) bilevel optimization problems. The given approaches generalize the well-known level bundle methods
, and one of the new algorithms possesses (nearly) dimension-independent iteration complexity.
Page:
659-659
Related
Batch download
Cited By
noting
Similar Literature
Submit Feedback
Please wait while the file you selected is being converted