Electronic Resource
Springer
Journal of optimization theory and applications
91 (1996), S. 731-738
ISSN:
1573-2878
Keywords:
Nonsmooth optimization
;
subgradient methods
;
aggregation
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A convex nonsmooth optimization problem is replaced by a sequence of line search problems along recursively updated rays. Convergence of the method is proved, and relations to existing methods are discussed.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02190130
Permalink
|
Location |
Call Number |
Expected |
Availability |