Separable programming. Theory and methods (Q5948302)
From MaRDI portal
scientific article; zbMATH DE number 1668675
Language | Label | Description | Also known as |
---|---|---|---|
English | Separable programming. Theory and methods |
scientific article; zbMATH DE number 1668675 |
Statements
Separable programming. Theory and methods (English)
0 references
5 November 2001
0 references
The author considers separable convex nonlinear programming problems, where the objective function and constraints consist of sums of convex functions depending on a single variable only. In most cases, it is assumed in addition that the functions are twice continuously differentiable. The first chapter of the book introduces convex analysis, i.e., convex sets and functions, directional derivatives, optimality criteria, and duality. Part I consists of three further chapters to define separable functions and linear approximations by adjacent function values over a given grid. A broader discussion of a dynamic programming approach follows together with some OR applications, particularly inventory models. In Part II, convex separable programs with bounds on variables are analyzed in more detail. Optimality conditions are derived in Chapter 5, and extensions for linear equality constraints in Chapter 6. Algorithms and convergence results for differentiable, convex and separable problems are the main topics of Chapters 7 and 8, whereas well-posedness and stability are studied in Chapter 9. Extensions and computational test results are found in Chapters 10 and 11. Part III of the book consists of three further chapters, where alternative non-smooth approximations, stochastic quasi-gradient methods and knapsack polytopes are outlined. The book covers the more classical area of convex, separable programming in a mathematically rigorous way. More modern concepts, such as interior point methods, are not treated. New topics are illustrated by detailed examples. Proofs are included, as well as a couple of applications from operations research. Algorithms and theoretical analysis are sometimes difficult to read because of complex index sets.
0 references
algorithms
0 references
convex nonlinear programming problems
0 references
convex analysis
0 references
convex sets
0 references
directional derivatives
0 references
optimality criteria
0 references
duality
0 references
separable functions
0 references
linear approximations
0 references
dynamic programming
0 references
inventory models
0 references
convex separable programs
0 references
linear equality constraints
0 references
convergence results
0 references
well-posedness
0 references
stability
0 references
non-smooth approximations
0 references
stochastic quasi-gradient methods
0 references
knapsack polytopes
0 references