Methods of descent for nondifferentiable optimization
Author(s)
Bibliographic Information
Methods of descent for nondifferentiable optimization
（Lecture notes in mathematics, 1133）
Springer-Verlag, c1985
- : gw
- : us
Available at / 76 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNM||11338507038S
-
Hokkaido University, Library, Graduate School of Science, Faculty of Science and School of Science研究室
: gw510/L4972021265771
-
No Libraries matched.
- Remove all filters.
Note
Bibliography: p. [354]-360
Includes index
Description and Table of Contents
Table of Contents
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.
by "Nielsen BookData"
