Simplicial algorithms for minimizing polyhedral functions
著者
書誌事項
Simplicial algorithms for minimizing polyhedral functions
Cambridge University Press, 2001
大学図書館所蔵 件 / 全12件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 239-242) and index
内容説明・目次
内容説明
Polyhedral functions provide a model for an important class of problems that includes both linear programming and applications in data analysis. General methods for minimizing such functions using the polyhedral geometry explicitly are developed. Such methods approach a minimum by moving from extreme point to extreme point along descending edges and are described generically as simplicial. The best-known member of this class is the simplex method of linear programming, but simplicial methods have found important applications in discrete approximation and statistics. The general approach considered in this text, first published in 2001, has permitted the development of finite algorithms for the rank regression problem. The key ideas are those of developing a general format for specifying the polyhedral function and the application of this to derive multiplier conditions to characterize optimality. Also considered is the application of the general approach to the development of active set algorithms for polyhedral function constrained problems and associated Lagrangian forms.
目次
- 1. Some basic convex analysis
- 2. Introduction to Polyhedra functions
- 3. Linear programming algorithms
- 4. Piecewise linear separable problems
- 5. Rank regression problems
- 6. Polyhedral constrained optimization.
「Nielsen BookData」 より
