Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

High Performance Optimization

  • Book
  • © 2000

Overview

Part of the book series: Applied Optimization (APOP, volume 33)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

For a long time the techniques of solving linear optimization (LP) problems improved only marginally. Fifteen years ago, however, a revolutionary discovery changed everything. A new `golden age' for optimization started, which is continuing up to the current time. What is the cause of the excitement? Techniques of linear programming formed previously an isolated body of knowledge. Then suddenly a tunnel was built linking it with a rich and promising land, part of which was already cultivated, part of which was completely unexplored. These revolutionary new techniques are now applied to solve conic linear problems. This makes it possible to model and solve large classes of essentially nonlinear optimization problems as efficiently as LP problems. This volume gives an overview of the latest developments of such `High Performance Optimization Techniques'. The first part is a thorough treatment of interior point methods for semidefinite programming problems. The second part reviews today's most exciting research topics and results in the area of convex optimization.
Audience: This volume is for graduate students and researchers who are interested in modern optimization techniques.

Similar content being viewed by others

Keywords

Table of contents (18 chapters)

  1. Theory and Algorithms of Semidefinite Programming

  2. Linear, Quadratic, Semidefinite Programming and Beyond

Editors and Affiliations

  • Erasmus University, Rotterdam, The Netherlands

    Hans Frenk, Shuzhong Zhang

  • Delft University of Technology, The Netherlands

    Kees Roos, Tamás Terlaky

Bibliographic Information

Publish with us