Interior Point Algorithms: Theory and Analysis (Wiley Series in Discrete Mathematics and Optimization) - Hardcover

Ye, Yinyu

Hardcover

ISBN 10: 0471174203 ISBN 13: 9780471174202

Verlag: Wiley-Interscience, 1997

Inhaltsangabe

The first comprehensive review of the theory and practice of one oftoday's most powerful optimization techniques.

The explosive growth of research into and development of interiorpoint algorithms over the past two decades has significantlyimproved the complexity of linear programming and yielded some oftoday's most sophisticated computing techniques. This book offers acomprehensive and thorough treatment of the theory, analysis, andimplementation of this powerful computational tool.

Interior Point Algorithms provides detailed coverage of all basicand advanced aspects of the subject. Beginning with an overview offundamental mathematical procedures, Professor Yinyu Ye movesswiftly on to in-depth explorations of numerous computationalproblems and the algorithms that have been developed to solve them.An indispensable text/reference for students and researchers inapplied mathematics, computer science, operations research,management science, and engineering, Interior Point Algorithms:
* Derives various complexity results for linear and convexprogramming
* Emphasizes interior point geometry and potential theory
* Covers state-of-the-art results for extension, implementation,and other cutting-edge computational techniques
* Explores the hottest new research topics, including nonlinearprogramming and nonconvex optimization.

Über diesen Titel

Über die Autorin bzw. den Autor

YINYU YE, PhD, is Professor in the Department of ManagementSciences at the University of Iowa College of BusinessAdministration and the Program in Applied Mathematical &Computational Sciences.

Von der hinteren Coverseite

The first comprehensive review of the theory and practice of one of today's most powerful optimization techniques.

The explosive growth of research into and development of interior point algorithms over the past two decades has significantly improved the complexity of linear programming and yielded some of today's most sophisticated computing techniques. This book offers a comprehensive and thorough treatment of the theory, analysis, and implementation of this powerful computational tool.

Interior Point Algorithms provides detailed coverage of all basic and advanced aspects of the subject. Beginning with an overview of fundamental mathematical procedures, Professor Yinyu Ye moves swiftly on to in-depth explorations of numerous computational problems and the algorithms that have been developed to solve them. An indispensable text/reference for students and researchers in applied mathematics, computer science, operations research, management science, and engineering, Interior Point Algorithms:

• Derives various complexity results for linear and convex programming
• Emphasizes interior point geometry and potential theory
• Covers state-of-the-art results for extension, implementation, and other cutting-edge computational techniques
• Explores the hottest new research topics, including nonlinear programming and nonconvex optimization.

The explosive growth of research into and development of interior point algorithms over the past two decades has significantly improved the complexity of linear programming and yielded some of today's most sophisticated computing techniques. This book offers a comprehensive and thorough treatment of the theory, analysis, and implementation of this powerful computational tool.

Interior Point Algorithms provides detailed coverage of all basic and advanced aspects of the subject. Beginning with an overview of fundamental mathematical procedures, Professor Yinyu Ye moves swiftly on to in-depth explorations of numerous computational problems and the algorithms that have been developed to solve them. An indispensable text/reference for students and researchers in applied mathematics, computer science, operations research, management science, and engineering, Interior Point Algorithms:

• Derives various complexity results for linear and convex programming
• Emphasizes interior point geometry and potential theory
• Covers state-of-the-art results for extension, implementation, and other cutting-edge computational techniques
• Explores the hottest new research topics, including nonlinear programming and nonconvex optimization.

Details zur Ausgabe

• Verlag: Wiley-Interscience
• Erscheinungsdatum: 1997
• Sprache: Englisch
• ISBN 10: 0471174203
• ISBN 13: 9780471174202
• Einband: Gebundene Ausgabe
• Auflage: 1
• Anzahl der Seiten: 440
• Kontakt zum Hersteller: Wiley-VCH GmbH; product_safety@wiley.com; ; Boschstrasse 12; Weinheim; 69469; Deutschland