Non-linear Programming
Theory and Algorithms
2nd Edition
Published on 18. January 1993
Book
Hardback
656 pages
978-0-471-55793-7 (ISBN)
Description
This updated textbook offers an overview of convex analysis, the foundations of optimization and computational methods. It emphasizes the implementation of numerical methods and focuses on the concept of error and the need to analyze and predict it.
More details
Series
Edition
2nd Revised edition
Language
English
Place of publication
New York
United States
Publishing group
John Wiley and Sons Ltd
Target group
College/higher education
Edition type
Revised edition
Illustrations
bibliography, index
Dimensions
Height: 259 mm
Width: 185 mm
Weight
1304 gr
ISBN-13
978-0-471-55793-7 (9780471557937)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Persons
Content
CONVEX ANALYSIS. Convex Sets. Convex Functions and Generalizations. OPTIMALITY CONDITIONS AND DUALITY. The Fritz John and the Karush-Kuhn-Tucker Optimality Conditions. Constraint Qualifications. Lagrangian Duality and Saddle Point Optimality Conditions. ALGORITHMS AND THEIR CONVERGENCE. The Concept of an Algorithm. Unconstrained Optimization. Penalty and Barrier Functions. Methods of Feasible Directions. Linear Complementary Problem, and Quadratic, Separable, Fractional, and Geometric Programming. Appendices. Bibliography. Index.