Skip to main content

Nonlinear Programming: Theory and Algorithms (Set), 3rd Edition

Hardcover

€157.30

*VAT

Nonlinear Programming: Theory and Algorithms (Set), 3rd Edition

Mokhtar S. Bazaraa, Hanif D. Sherali, C. M. Shetty

ISBN: 978-1-118-85756-4 September 2013 1046 Pages

Download Product Flyer

Download Product Flyer

Download Product Flyer is to download PDF in new tab. This is a dummy description. Download Product Flyer is to download PDF in new tab. This is a dummy description. Download Product Flyer is to download PDF in new tab. This is a dummy description. Download Product Flyer is to download PDF in new tab. This is a dummy description.

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.

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.