Nonlinear programming: sequential unconstrained minimization techniques
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Fiacco, Anthony V. 1928-2013 (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Philadelphia, Pa. Society for Industrial and Applied Mathematics 1990
Schriftenreihe:Classics in applied mathematics 4
Schlagworte:
Online-Zugang:TUM01
UBW01
UBY01
UER01
Volltext
Beschreibung:Mode of access: World Wide Web. - System requirements: Adobe Acrobat Reader
Includes bibliographical references (s. 196-201) and indexes
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
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
Beschreibung:1 Online-Ressource (xvi, 210 Seiten)
ISBN:0898712548
9780898712544
DOI:10.1137/1.9781611971316

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen