Skip to content
Register Sign in Wishlist
Lectures on Modern Convex Optimization

Lectures on Modern Convex Optimization
Analysis, Algorithms, and Engineering Applications

£116.00

Part of MPS-SIAM Series on Optimization

  • Date Published: August 2001
  • availability: Available in limited markets only
  • format: Paperback
  • isbn: 9780898714913

£ 116.00
Paperback

Available in limited markets only
Unavailable Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programming. The authors present the basic theory underlying these problems as well as their numerous applications in engineering, including synthesis of filters, Lyapunov stability analysis, and structural design. The authors also discuss the complexity issues and provide an overview of the basic theory of state-of-the-art polynomial time interior point methods for linear, conic quadratic, and semidefinite programming. The book's focus on well-structured convex problems in conic form allows for unified theoretical and algorithmical treatment of a wide spectrum of important optimization problems arising in applications.

    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: August 2001
    • format: Paperback
    • isbn: 9780898714913
    • length: 504 pages
    • dimensions: 254 x 178 x 25 mm
    • weight: 0.864kg
    • availability: Available in limited markets only
  • Table of Contents

    Preface
    Lecture 1. Linear Programming
    Lecture 2. From Linear Programming to Conic Programming
    Lecture 3. Conic Quadratic Programming
    Lecture 4. Semidefinite Programming
    Lecture 5. Computational Tractability of Convex Programs
    Lecture 6. Interior Point Polynomial Time Methods for Linear Programming, Conic Quadratic Programming, and Semidefinite Programming
    Solutions to Selected Exercises
    Index.

  • Authors

    Aharon Ben-Tal, Technion - Israel Institute of Technology, Haifa

    Arkadi Nemirovski, Technion - Israel Institute of Technology, Haifa

Related Books

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

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