Skip to content
Register Sign in Wishlist
Interior Point Polynomial Algorithms in Convex Programming

Interior Point Polynomial Algorithms in Convex Programming

£96.00

Part of Studies in Applied and Numerical Mathematics

  • Date Published: June 2006
  • availability: Available in limited markets only
  • format: Paperback
  • isbn: 9780898715156

£ 96.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
  • Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. In this book, the authors describe the first unified theory of polynomial-time interior-point methods. Their approach provides a simple and elegant framework in which all known polynomial-time interior-point methods can be explained and analyzed; this approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.

    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: June 2006
    • format: Paperback
    • isbn: 9780898715156
    • length: 415 pages
    • dimensions: 255 x 177 x 25 mm
    • weight: 0.852kg
    • availability: Available in limited markets only
  • Table of Contents

    1. Self-concordant functions and Newton method
    2. Path-following interior-point methods
    3. Potential Reduction interior-point methods
    4. How to construct self- concordant barriers
    5. Applications in convex optimization
    6.Variational inequalities with monotone operators
    7. Acceleration for linear and linearly constrained quadratic problems
    Bibliography
    Appendix 1
    Appendix 2.

  • Authors

    Yurii Nesterov

    Arkadii Nemirovskii

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