Nonlinear Programming
Theory and Algorithms (Set)
3rd Edition
Will be published approx. on 4. March 2014
Book
Paperback/Softback
1046 pages
978-1-118-85756-4 (ISBN)
Description
Presenting recent developments of key topics in nonlinear programming, this text looks specifically at three main areas; convex analysis, optimality conditions and dual computational techniques.
More details
Edition
3rd edition
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Product notice
Paperback (trade)
sewn/stitched
Cloth over boards
Dimensions
Height: 241 mm
Width: 165 mm
Thickness: 61 mm
Weight
1633 gr
ISBN-13
978-1-118-85756-4 (9781118857564)
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 Classification
Persons
Mokhtar S. BAZARAA, PhD, is a Professor at the Georgia Institute of Technology. HANIF D. SHERALI, PhD, is a W. Thomas Rice Chaired Professor of Engineering in the Grado Department of Industrial and Systems Engineering at Virginia Polytechnic Institute and State University.
C. M. SHETTY, PhD, is a Professor Emeritus at the Georgia Institute of Technology.
Professors Bazaraa and Sherali are also coauthors of the complementary bestselling book, Linear Programming and Network Flows, Third Edition, also published by Wiley.
C. M. SHETTY, PhD, is a Professor Emeritus at the Georgia Institute of Technology.
Professors Bazaraa and Sherali are also coauthors of the complementary bestselling book, Linear Programming and Network Flows, Third Edition, also published by Wiley.
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.
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.