Methods of Descent for Nondifferentiable Optimization [electronic resource] /
Fundamentals -- Aggregate subgradient methods for unconstrained convex minimization -- Methods with subgradient locality measures for minimizing nonconvex functions -- Methods with subgradient deletion rules for unconstrained nonconvex minimization -- Feasible point methods for convex constrained minimization problems -- Methods of feasible directions for nonconvex constrained problems -- Bundle methods -- Numerical examples.
Saved in:
Main Authors: | , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,
1985
|
Subjects: | Mathematics., System theory., Calculus of variations., Systems Theory, Control., Calculus of Variations and Optimal Control; Optimization., |
Online Access: | http://dx.doi.org/10.1007/BFb0074500 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|