Free shipping on orders over $99
Simplicial Algorithms for Minimizing Polyhedral Functions

Simplicial Algorithms for Minimizing Polyhedral Functions

by M. R. Osborne
Paperback
Publication Date: 15/09/2011

Share This Book:

RRP  $59.95

RRP means 'Recommended Retail Price' and is the price our supplier recommends to retailers that the product be offered for sale. It does not necessarily mean the product has been offered or sold at the RRP by us or anyone else.

$59.50
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.
ISBN:
9781107403505
9781107403505
Category:
Numerical analysis
Format:
Paperback
Publication Date:
15-09-2011
Language:
English
Publisher:
Cambridge University Press
Country of origin:
United Kingdom
Pages:
262
Dimensions (mm):
229x152x15mm
Weight:
0.39kg

This title is in stock with our overseas supplier and should be sent from our Sydney warehouse within 3 - 4 weeks of you placing an order.  

Once received into our warehouse we will despatch it to you with a Shipping Notification which includes online tracking.

Please check the estimated delivery times below for your region, for after your order is despatched from our warehouse:

ACT Metro 2 working days

NSW Metro 2 working days 

NSW Rural 2-3 working days

NSW Remote 2-5 working days

NT Metro 3-6 working days

NT Remote 4-10 working days

QLD Metro 2-4 working days

QLD Rural 2-5 working days

QLD Remote 2-7 working days

SA Metro 2-5 working days

SA Rural 3-6 working days

SA Remote 3-7 working days

TAS Metro 3-6 working days

TAS Rural 3-6 working days

VIC Metro 2-3 working days

VIC Rural 2-4 working days

VIC Remote 2-5 working days

WA Metro 3-6 working days

WA Rural 4-8 working days

WA Remote 4-12 working days

Reviews

Be the first to review Simplicial Algorithms for Minimizing Polyhedral Functions.