Simplicial Algorithms for Minimizing Polyhedral Functions
Simplicial Algorithms for Minimizing Polyhedral Functions
CAD$53.95
This book provides the first general account of the development of simplicial algorithms. These include the ubiquitous simplex method of linear programming widely used in industrial optimization and strategic decision making and methods important in data analysis, such as problems involving very large data sets. The theoretical development is based on a new way of representing the underlying geometry of polyhedra functions (functions whose graphs are made up of plane faces), and is capable of resolving problems that occur when combinatorially large numbers of faces intersect at each vertex.
- Implementation questions are considered for a series of problems of increasing complexity
- Compact representations are given of the subdifferential, and hence of the conditions for optimality
Reviews & endorsements
Review of the hardback: '… will be very useful to researchers and students in the field … will certainly serve as a standard reference on the subject for a long time.' Numerical Algorithms
Review of the hardback: 'The book has a rich content and can be recommended to all optimizers, it is even a good supplement for specialists.' Alfred Göpfert, Zentralblatt für Mathematik
Review of the hardback: 'The treatment is mathematical (definition, lemma, theorem, proof type of text) but attention is paid to algorithms and practical implementation aspects too. It is easy to read and a reference book for novice students as well as for implementors of the methods.' Bulletin of the Belgian Mathematical Society
Product details
September 2011Paperback
9781107403505
262 pages
229 × 152 × 15 mm
0.39kg
Available
Table of Contents
- 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.
