ISSN:
1436-4646
Keywords:
Nondifferentiable optimization
;
Composite NDO
;
Basic NDO
;
Second-order convergence
;
Global convergence
;
Polyhedral approximation
;
Convex programming
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract There are two main classes of iterative methods in nondifferentiable optimization (NDO). In thebasic NDO, the information is limited to the objective function and at least one element of its subdifferential, while in thecomposite NDO, the objective function is split into a sum of a smooth and a nonsmooth function. Our work unifies these two approaches for benefiting of their respective advantages.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01585939
Permalink