The mathematics of nonlinear programming

From MaRDI portal





The book is aimed at readers who have a working knowledge of linear algebra and basic calculus. It starts with classical optimization notions from calculus and proceeds smoothly to a study of convex functions. This is followed by material on basic numerical methods, least squares, Karush-Kuhn-Tucker theory, penalty functions and Lagrange multipliers. The authors do not attempt to be encyclopedic, but such classical techniques as Newton's Method and the Method of Steepest Descent as well as the more modern approaches of Broyden's Method, the Davidson-Fletcher- Powell Method, the Broyden-Fletcher-Goldfarb-Shanno Method and the duality theory of Geometric Programming are considered in some detail. There are many carefully chosen exercises and examples which illustrate the developed theory. This supplies an unexperienced reader, with modest backgrounds in formal mathematics, by means of gaining an understanding of the essential content without studying all the proofs in detail. The book provides a useful addition to the existing literature and can be used as a basis for an undergraduate course in nonlinear programming.




Cited in
(69)








This page was built for publication: The mathematics of nonlinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3994363)