Skip to content
Register Sign in Wishlist
Look Inside Simplicial Algorithms for Minimizing Polyhedral Functions

Simplicial Algorithms for Minimizing Polyhedral Functions


  • Date Published: September 2011
  • availability: Available
  • format: Paperback
  • isbn: 9781107403505

£ 28.99

Add to cart Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • 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.

    • 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
    Read more

    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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: September 2011
    • format: Paperback
    • isbn: 9781107403505
    • length: 262 pages
    • dimensions: 229 x 152 x 15 mm
    • weight: 0.39kg
    • availability: 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.

  • Author

    M. R. Osborne, Australian National University, Canberra

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.