Simplicial Algorithms for Minimizing Polyhedral Functions

by M. R. Osborne

Overview

This book, first published in 2001, provides a general account of the development of simplicial algorithms.

Product Details

ISBN-13:	9780521791335
Publisher:	Cambridge University Press
Publication date:	01/08/2001
Pages:	262
Product dimensions:	5.98(w) x 9.02(h) x 0.75(d)

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.

Editorial Reviews

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

From the Publisher