The Linearization Method for Constrained Optimization

Front Cover
Springer-Verlag, 1994 - Mathematics - 147 pages
0 Reviews
Techniques of optimization are applied in many problems in economics, automatic control etc. and a wealth of literature is devoted to the subject. The first computer applications involved linear programming problems with simple structure and comparatively uncomplicated nonlinear problems; these could be solved readily with the computational power of existing machines.
Problems of increasing size and nonlinear complexity made it necessary to develop a complete new arsenal of methods for obtaining numerical results in a reasonable time.
The Linearization Method is one of the fruits of this research of the last 20 years. It is closely related to Newton's method for solving systems of linear equations, to penalty function methods (and, hence, to methods of nondifferentiable optimization) and to variable metrics.
The author of this book is one of the pioneers of this approach - a fact that is not widely known even to specialists. The book provides - for a wide readership including engineers, economists, and optimization specialists from graduate student level on - a brief yet quite complete exposition of one of the most effective methods of solution of constrained optimization problems.

From inside the book

What people are saying - Write a review

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

Contents

Convex and Quadratic Programming
1
The Linearization Method
43
The Discrete Minimax Problem and Algorithms
99
Copyright

1 other sections not shown

Common terms and phrases

Bibliographic information