Nonlinear Programming

Front Cover
SIAM, 1969 - Mathematics - 220 pages
0 Reviews
This reprint of the 1969 book of the same name is a concise, rigorous, yet accessible, account of the fundamentals of constrained optimization theory. Many problems arising in diverse fields such as machine learning, medicine, chemical engineering, structural design, and airline scheduling can be reduced to a constrained optimization problem. This book provides readers with the fundamentals needed to study and solve such problems. Beginning with a chapter on linear inequalities and theorems of the alternative, basics of convex sets and separation theorems are then derived based on these theorems. This is followed by a chapter on convex functions that includes theorems of the alternative for such functions. These results are used in obtaining the saddlepoint optimality conditions of nonlinear programming without differentiability assumptions.
 

What people are saying - Write a review

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

Contents

CL10_ch1
1
CL10_ch2
16
CL10_ch3
38
CL10_ch4
54
CL10_ch5
69
CL10_ch6
83
CL10_ch7
92
CL10_ch8
113
CL10_ch10
151
CL10_ch11
161
CL10_appendixa
177
CL10_appendixb
182
CL10_appendixc
191
CL10_appendixd
200
CL10_backmatter
205
Copyright

CL10_ch9
131

Other editions - View all

Common terms and phrases

Bibliographic information