Beschreibung:
This text is designed for a one-semester course in optimization taken by advanced undergraduate and beginning graduate students in the mathematical sciences and engineering. It teaches students the basics of continuous optimization and helps them better understand the mathematics from previous courses. The book focuses on general problems and the underlying theory. It covers the fundamental problems of constrained and unconstrained optimization, linear and convex programming, basic iterative solution algorithms, and more general iterative optimization methods.
Optimization without Calculus. Geometric Programming. Basic Analysis. Convex Sets. Vector Spaces and Matrices. Linear Programming. Matrix Games and Optimization. Differentiation. Convex Functions. Convex Programming. Iterative Optimization. Solving Systems of Linear Equations. Conjugate-Direction Methods. Operators. Looking Ahead. Bibliography. Index.