Nonlinear Programming Theory Algorithms, First Edition (2 results)

Hardcover. Condition: Good. No Jacket. First Edition. Hardcover 4th printing. Good+ condition. The covers show some wear to the corners and spine ends. The binding is square and tight. Small abrasion to the front flyleaf. The interior pages are clean and unmarked. The book will be carefully packaged for shipment for protection from the elements. USPS electronic tracking number issued free of charge. A comprehensive, rigorous, and self-contained development of the central topics in nonlinear programming. Organized into three major sections: convex analysis, optimality conditions and duality, and algorithms and their convergence. Precise statements of the algorithms are given, along with convergence analysis. Among the topics covered are convex sets and functions, Fritz John and Kuhn Tucker optimality conditions, Lagrangian duality, Saddle Point optimality, constrained and unconstrained optimization, and the development of computational schemes. Includes extensive illustrations, examples, and references.

Soft cover. Condition: New. 1st Edition. Nonlinear Programming: Theory and Algorithms now in an extensively updated Third Edition addresses the problem of optimizing an objective function in the presence of equality and inequality constraints. Many realistic problems cannot be adequately represented as a linear program owing to the nature of the nonlinearity of the objective function and/or the nonlinearity of any constraints. The Third Edition begins with a general introduction to nonlinear programming with illustrative examples and guidelines for model construction. Concentration on the three major parts of nonlinear programming is provided: · Convex analysis with discussion of topological properties of convex sets, separation and support of convex sets, polyhedral sets, extreme points and extreme directions of polyhedral sets, and linear programming · Optimality conditions and duality with coverage of the nature, interpretation, and value of the classical Fritz John (FJ) and the Karush-Kuhn-Tucker (KKT) optimality conditions; the interrelationships between various proposed constraint qualifications; and Lagrangian duality and saddle point optimality conditions · Algorithms and their convergence, with a presentation of algorithms for solving both unconstrained and constrained nonlinear programming problems Important features of the Third Edition include: · New topics such as second interior point methods, nonconvex optimization, nondifferentiable optimization, and more · Updated discussion and new applications in each chapter · Detailed numerical examples and graphical illustrations · Essential coverage of modeling and formulating nonlinear programs · Simple numerical problems · Advanced theoretical exercises The book is a solid reference for professionals as well as a useful text for students in the fields of operations research, management science, industrial engineering, applied mathematics, and also in engineering disciplines that deal with analytical optimization techniques. The logical and self-contained format uniquely covers nonlinear programming techniques with a great depth of information and an abundance of valuable examples and illustrations that showcase the most current advances in nonlinear problems.