Skip to content
Register Sign in Wishlist
Discrete Convex Analysis

Discrete Convex Analysis

$155.00

Part of Monographs on Discrete Mathematics and Applications

  • Date Published: July 2003
  • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • format: Paperback
  • isbn: 9780898715408

$ 155.00
Paperback

This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Unavailable Add to wishlist

Looking for an inspection copy?

This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact asiamktg@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Discrete Convex Analysis is a novel paradigm for discrete optimization that combines the ideas in continuous optimization (convex analysis) and combinatorial optimization (matroid/submodular function theory) to establish a unified theoretical framework for nonlinear discrete optimization. The study of this theory is expanding with the development of efficient algorithms and applications to a number of diverse disciplines like matrix theory, operations research, and economics. This self-contained book is designed to provide a novel insight into optimization on discrete structures and should reveal unexpected links among different disciplines. It is the first and only English-language monograph on the theory and applications of discrete convex analysis. Discrete Convex Analysis provides the information that professionals in optimization will need to “catch up” with this new theoretical development. It also presents an unexpected connection between matroid theory and mathematical economics and expounds a deeper connection between matrices and matroids than most standard textbooks.

    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: July 2003
    • format: Paperback
    • isbn: 9780898715408
    • length: 411 pages
    • dimensions: 261 x 181 x 25 mm
    • weight: 0.886kg
    • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • Table of Contents

    List of Figures
    Notation
    Preface
    1. Introduction to the Central Concepts
    2. Convex Functions with Combinatorial Structures
    3. Convex Analysis, Linear Programming, and Integrality
    4. M-Convex Sets and Submodular Set Functions
    5. L-Convex Sets and Distance Functions
    6. M-Convex Functions
    7. L-Convex Functions
    8. Conjugacy and Duality
    9. Network Flows
    10. Algorithms
    11. Application to Mathematical Economics
    12. Application to Systems Analysis by Mixed Matrices
    Bibliography
    Index..

  • Author

    Kazuo Murota, University of Tokyo

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

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

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 www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

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.

Cancel

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.
×