A reprint of the original volume, which won the Lanchester Prize awarded by the Operations Research Society of America for the best work of 1968. Although out of print for nearly 15 years, it remains one of the most referenced volumes in the field of mathematical programming.
Recent interest in interior point methods generated by Karmarkar's Projective Scaling Algorithm has created a new demand for this book because the methods that have followed from Karmarkar's bear a close resemblance to those described. There is no other source for the theoretical background of the logarithmic barrier function and other classical penalty functions.
Analyzes in detail the ""central"" or ""dual"" trajectory used by modern path following and primal/dual methods for convex and general linear programming. As researchers begin to extend these methods to convex and general nonlinear programming problems, this book will become indispensable to them.
Reihe
Sprache
Verlagsort
Zielgruppe
Produkt-Hinweis
Maße
Höhe: 230 mm
Breite: 150 mm
Dicke: 12 mm
Gewicht
ISBN-13
978-0-89871-254-4 (9780898712544)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Chapter 1: Introduction
Chapter 2: Mathematical Programming Theory
Chapter 3: Interior Point Unconstrained Minimization Techniques
Chapter 4: Exterior Point Unconstrained Minimization Techniques
Chapter 5: Extrapolation in Unconstrained Minimization Techniques
Chapter 6: Convex Programming
Chapter 7: Other Unconstrained Minimization Techniques
Chapter 8: Computational Aspects of Unconstrained Minimization Algorithms
Author Index
Subject Index.
