Methods of Descent for Nondifferentiable Optimization
โ Scribed by Krzysztof C. Kiwiel (auth.)
- Publisher
- Springer-Verlag Berlin Heidelberg
- Year
- 1985
- Tongue
- English
- Leaves
- 368
- Series
- Lecture Notes in Mathematics 1133
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Table of Contents
Fundamentals....Pages 1-43
Aggregate subgradient methods for unconstrained convex minimization....Pages 44-86
Methods with subgradient locality measures for minimizing nonconvex functions....Pages 87-138
Methods with subgradient deletion rules for unconstrained nonconvex minimization....Pages 139-189
Feasible point methods for convex constrained minimization problems....Pages 190-228
Methods of feasible directions for nonconvex constrained problems....Pages 229-298
Bundle methods....Pages 299-344
Numerical examples....Pages 345-353
โฆ Subjects
Systems Theory, Control; Calculus of Variations and Optimal Control; Optimization
๐ SIMILAR VOLUMES
<p>Polynomial extremal problems (PEP) constitute one of the most important subclasses of nonlinear programming models. Their distinctive feature is that an objective function and constraints can be expressed by polynomial functions in one or several variables. Let :e = {:e 1, ... , :en} be the vecto