ISSN:
1436-4646
Keywords:
Nonsmooth convex optimization
;
Bundle methods
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract In this paper we describe a number of new variants of bundle methods for nonsmooth unconstrained and constrained convex optimization, convex—concave games and variational inequalities. We outline the ideas underlying these methods and present rate-of-convergence estimates.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01585555
Permalink