Nonlinear programming: analysis and methods

Front Cover
Prentice-Hall, 1976 - Mathematics - 512 pages
0 Reviews
Classical optimization - unconstrained and equality constrained problems; Optimality conditions for constrained extrema; Convex sets and functions; Duality in nonlinear convex programming; Generalized convexity; Analysis of selected nonlinear programming problems; One-dimensional optimization; Multidimensional unconstrained optimization without derivative: empirical and conjugate direction methods; Second derivative, steepest descent and conjugate gradient methods; Variable metric algorithms; Penalty function methods; Solution of constrained problems by extensions of unconstrained optimization techniques; Approximation-type algorithms.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

CLASSICAL OPTIMIZATION
9
OPTIMALITY CONDITIONS FOR CONSTRAINED
27
CONVEX SETS AND FUNCTIONS
63
Copyright

11 other sections not shown

Other editions - View all

Common terms and phrases

References to this book

All Book Search results »

Bibliographic information