Simplicial Algorithms for Minimizing Polyhedral Functions (Paperback)

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.

General

Imprint:	Cambridge UniversityPress
Country of origin:	United Kingdom
Release date:	September 2011
First published:	June 2011
Authors:	M. R. Osborne
Dimensions:	229 x 152 x 15mm (L x W x T)
Format:	Paperback - Trade
Pages:	262
ISBN-13:	978-1-107-40350-5
Categories:	Books > Science & Mathematics > Mathematics > Numerical analysis Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematical modelling
LSN:	1-107-40350-2
Barcode:	9781107403505

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!